[洛谷P2701] 巨大的牛棚Big Barn（悬线法）

https://www.luogu.org/problemnew/show/P2701

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#define ll long long
#define pb push_back
#define test printf("here!!!")
using namespace std;
const int mx=1000+10;
int mp[mx][mx];
int up[mx][mx];
int left[mx][mx];
int right[mx][mx];
int main()
{
    int maxn=-1;
    int n,t,x,y;
    scanf("%d%d",&n,&t);
    for (int i=1;i<=t;++i)
    {
        scanf("%d%d",&x,&y);
        mp[x][y]=1;
    }
    for (int i=1;i<=n;++i)
    {
        left[i][0]=1;
        for (int j=1;j<=n;++j)
        {
            left[i][j]=right[i][j]=j;
            up[i][j]=1;
            if (mp[i][j]==0&&mp[i][j]==mp[i][j-1])
            {
                left[i][j]=left[i][j-1];
            }
        }
        right[i][n+1]=n;
        for (int j=n;j>=1;--j)
        {
            right[i][j]=j;
            if (mp[i][j]==0&&mp[i][j]==mp[i][j+1])
            {
                right[i][j]=right[i][j+1];
            }
        }
    }
    for (int i=1;i<=n;++i)
    {
        for (int j=1;j<=n;++j)
        {
            if (mp[i][j]==0&&mp[i][j]==mp[i-1][j])
            {
                if (i>1)
                {
                    left[i][j]=max(left[i][j],left[i-1][j]);
                    right[i][j]=min(right[i][j],right[i-1][j]);
                    up[i][j]=up[i-1][j]+1;
                }
                maxn=max(min(up[i][j],right[i][j]-left[i][j]+1),maxn);
            }
        }
    }
    /*while (1)
    {
        scanf("%d%d",&x,&y);
        printf("(%d,%d)--up:%d  left:%d  right:%d  \n",x,y,up[x][y],left[x][y],right[x][y]);
    }*/
    printf("%d\n",maxn);
}