[ZJOI2007]棋盘制作

最新推荐文章于 2025-06-24 19:20:39 发布

转载最新推荐文章于 2025-06-24 19:20:39 发布 · 54 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/lizehon/p/10630488.html

Luogu1169

悬线法

#include<cstdio>
using namespace std;
const int MAXN=2005;
int a[MAXN][MAXN],left[MAXN][MAXN],right[MAXN][MAXN],up[MAXN][MAXN];
int n,m,ans1,ans2;
int Max(int x,int y){return x>y?x:y;}
int Min(int x,int y){return x<y?x:y;}
inline int read(){
    int res=0;char c=getchar();
    while(c<'0'||c>'9')c=getchar();
    while(c>='0'&&c<='9'){res=(res<<3)+(res<<1)+c-48;c=getchar();}
    return res;
}
int main(){
    n=read();m=read();
    for(register int i=1;i<=n;i++)
        for(register int j=1;j<=m;j++){
            a[i][j]=read();
            left[i][j]=right[i][j]=j;
            up[i][j]=1;
        }
    for(register int i=1;i<=n;i++){
        for(register int j=2;j<=m;j++)
            if(a[i][j]!=a[i][j-1])
                left[i][j]=left[i][j-1];
        for(register int j=m-1;j>=1;j--)
            if(a[i][j]!=a[i][j+1])
                right[i][j]=right[i][j+1];
    }
    for(register int i=1;i<=n;i++){
        for(register int j=1;j<=m;j++){
            if(i>1&&a[i][j]!=a[i-1][j]){
                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;
            }
            int a=right[i][j]-left[i][j]+1;
            int b=Min(a,up[i][j]);
            ans1=Max(ans1,b*b);
            ans2=Max(ans2,a*up[i][j]);
        }
    }
    printf("%d\n%d",ans1,ans2);
}

转载于:https://www.cnblogs.com/lizehon/p/10630488.html