#include <bits/stdc++.h>
#define int long long
using namespace std;
string yn(bool ans,string y="YES",string n="NO"){
return (ans?y:n);
}
#define all(a) a.begin(),a.end()
void gogo(){
int n,m;
cin>>n>>m;
int a[n][m];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>a[i][j];
}
}
int ans=-INT_MAX;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
for(int ii=0;ii<n;ii++){
for(int jj=0;jj<m;jj++){
ans=max(ans,max(a[i][j],a[ii][jj])-min(a[i][j],a[ii][jj])-1-abs(i-ii)-abs(j-jj));
}
}
}
}
cout<<ans<<endl;
}
main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t=1;
// cin>>t;
while(t--){
gogo();
}
}
Compilation message
maxcomp.cpp:29:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
29 | main(){
| ^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
344 KB |
Output is correct |
2 |
Correct |
3 ms |
344 KB |
Output is correct |
3 |
Correct |
3 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
20 ms |
344 KB |
Output is correct |
10 |
Correct |
14 ms |
348 KB |
Output is correct |
11 |
Correct |
15 ms |
348 KB |
Output is correct |
12 |
Correct |
14 ms |
492 KB |
Output is correct |
13 |
Correct |
19 ms |
724 KB |
Output is correct |
14 |
Correct |
28 ms |
516 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
3 ms |
344 KB |
Output is correct |
10 |
Correct |
3 ms |
344 KB |
Output is correct |
11 |
Correct |
3 ms |
348 KB |
Output is correct |
12 |
Correct |
20 ms |
344 KB |
Output is correct |
13 |
Correct |
14 ms |
348 KB |
Output is correct |
14 |
Correct |
15 ms |
348 KB |
Output is correct |
15 |
Correct |
14 ms |
492 KB |
Output is correct |
16 |
Correct |
19 ms |
724 KB |
Output is correct |
17 |
Correct |
28 ms |
516 KB |
Output is correct |
18 |
Execution timed out |
1031 ms |
16720 KB |
Time limit exceeded |
19 |
Halted |
0 ms |
0 KB |
- |