Submission #96439

#TimeUsernameProblemLanguageResultExecution timeMemory
96439KLPPMaxcomp (info1cup18_maxcomp)C++14
15 / 100
5 ms376 KiB
#include<bits/stdc++.h> using namespace std; typedef long long int lld; lld abs(lld a){ if(a>0)return a; return -a; } int main(){ int n,m; cin>>n>>m; lld matrix[n][m]; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cin>>matrix[i][j]; } } lld ans=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ for(int k=0;k<n;k++){ for(int l=0;l<m;l++){ ans=max(ans,matrix[i][j]-matrix[k][l]-abs(i-k)-abs(j-l)-1); } } } } cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...