蒟蒻求教

莫名MLE

代码：

#include<cstdio>
#include<algorithm>

using namespace std;

int mp[2501][2501]={};
int l[2501][2501],r[2510][2510],u[2501][2501]/*,d[2510][2510]*/;
//l[i][j]:how many 0 together in the left of (i,j) excluding itself

int dp1[2501][2501],dp2[2501][2501];

int main()
{
    int i,j;
    int n=0,m=0;scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)for(j=1;j<=m;j++)scanf("%d",&mp[i][j]);
    for(i=1;i<=n;i++)for(j=1;j<=m;j++)l[i][j]=mp[i][j-1]?0:l[i][j-1]+1,u[i][j]=mp[i-1][j]?0:u[i-1][j]+1;
    for(i=n;i>=1;i--)for(j=m;j>=1;j--)r[i][j]=mp[i][j+1]?0:r[i][j+1]+1/*,d[i][j]=mp[i+1][j]?0:d[i+1][j]+1*/;
    for(i=1;i<=n;i++)for(j=1;j<=m;j++)dp1[i][j]=mp[i][j]?min(min(l[i][j],u[i][j]),dp1[i-1][j-1])+1:0;
    for(i=1;i<=n;i++)for(j=m;j>=1;j--)dp2[i][j]=mp[i][j]?min(min(r[i][j],u[i][j]),dp2[i-1][j+1])+1:0;
    int maxn=0;for(i=1;i<=n;i++)for(j=1;j<=m;j++)maxn=max(maxn,dp1[i][j]),maxn=max(maxn,dp2[i][j]);
    printf("%d",maxn);return 0;
}

评测记录