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>
using namespace std;
long long x[1010][1010],n,m,a[1010][1010],ans=-2;
int main()
{
cin>>n>>m;
for(long long i=1;i<=n;++i)
for(long long j=1;j<=m;++j)
{
cin>>a[i][j];
a[i][j]+=i+j;
x[i][j]=a[i][j];
}
for(long long i=n;i>=1;--i)
for(long long j=m;j>=1;--j)
{
if(i<n&&j<m)
x[i][j]=min(x[i][j],min(x[i+1][j],x[i][j+1]));
else if(i==n&&j!=m)
x[i][j]=min(x[i][j],x[i][j+1]);
else if(i!=n&&j==m)
x[i][j]=min(x[i][j],x[i+1][j]);
if(ans<a[i][j]-x[i][j]-1)
ans=a[i][j]-x[i][j]-1;
}
for(long long i=n;i>=1;--i)
for(long long j=m;j>=1;--j)
{
a[i][j]-=2*(i+j);
x[i][j]=a[i][j];
if(i<n&&j<m)
x[i][j]=max(x[i][j],max(x[i+1][j],x[i][j+1]));
else if(i==n&&j!=m)
x[i][j]=max(x[i][j],x[i][j+1]);
else if(i!=n&&j==m)
x[i][j]=max(x[i][j],x[i+1][j]);
if(ans<x[i][j]-a[i][j]-1)
ans=x[i][j]-a[i][j]-1;
}
cout<<ans;
return 0;
}
# | 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... |