-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtraceMatrix.cpp
More file actions
63 lines (58 loc) · 1.66 KB
/
traceMatrix.cpp
File metadata and controls
63 lines (58 loc) · 1.66 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
//https://www.codechef.com/problems/TRACE
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=a;i>b;i--)
#define MEM(x,a) memset(x,a,sizeof(x));
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define ROFEACH(it, l) for (auto it = l.end(); it !=l.begin(); it--)
typedef long long LL;
typedef long long ULL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<long> VL;
typedef vector<long long> VLL;
typedef vector<string> VS;
typedef vector<char> VC;
template < class T > T MAX( T a, T b ){return ( a > b ? a : b );}
template < class T > T MIN( T a, T b ){return ( a < b ? a : b );}
template<class T> T GCD(T a,T b){if(b == 0)return a;return gcd(b,a%b);}
template<class T> T LCM(T a, T b ){return (a*b)/gcd(a,b);}
//Convert int to string
template <typename T> string to_str(T str){stringstream stream; stream << str; return stream.str();}
template <typename T>int to_int(T num){int val; stringstream stream; stream<<num; stream>>val; return val;}
vector<string> split(string &s,char delim){vector<string> elems;stringstream ss(s); string item;while(getline(ss,item,delim)){elems.push_back(item);}return elems;}
int sol(int n, vector<VI> v){
int mx;
FOR(i, 0, n){
FOR(j, 0, n){
int k = 0;
int ds = 0;
while(MAX(i, j) + k < n){
ds += v[i + k][j + k];
++k;
}
mx = MAX(mx, ds);
}
}
return mx;
}
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
vector<VI> v(n, VI(n));
FOR(i, 0, n){
FOR(j, 0, n){
cin>>v[i][j];
}
}
int s = sol(n, v);
cout<<s<<endl;
}
return 0;
}