Submission #1318923

#TimeUsernameProblemLanguageResultExecution timeMemory
1318923neonglitchMaxcomp (info1cup18_maxcomp)C++20
60 / 100
1095 ms4348 KiB
#include <iostream> using namespace std; const int N=1e3+10; int a[N][N]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,m; cin>>n>>m; for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { cin>>a[i][j]; } } int ans=-1e9; for(int x=0;x<n;x++) { for(int y=0;y<m;y++) { for(int x1=0;x1<n;x1++) { for(int y1=0;y1<m;y1++) { int S=a[x][y]-a[x1][y1]-(abs(x-x1)+abs(y-y1)+1); ans=max(ans,S); } } } } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...