# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
316992 | daniel920712 | Maxcomp (info1cup18_maxcomp) | C++14 | 3 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int all[1005][1005];
int main()
{
int N,M,ans=0,i,j,k,l;
scanf("%d %d",&N,&M);
for(i=0;i<N;i++) for(j=0;j<M;j++) scanf("%d",&all[i][j]);
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
for(k=0;k<M;k++)
{
for(l=0;l<M;l++) ans=max(ans,abs(all[i][k]-all[j][l])-abs(i-j)-abs(k-l)-1);
}
}
}
printf("%d\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |