BZOJ1057&&洛谷P1169 [ZJOI2007]棋盘制作

不难发现若黑白格子交替出现 ，那么将奇数位或偶数位的格子颜色翻转，那么整个正方形或矩形应该是全黑或全白的

然后就求纯色最大就好了，要求两遍，将奇数位翻转，将偶数为翻转

代码

//By AcerMo
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std; 
const int M=2050;
int n,m,emm,ans,que;
int f[M][M],a[M][M],l[M][M],r[M][M],L[M][M],R[M][M],h[M][M];
char ch;
inline void slove()
{
    for (int i=1;i<=n;i++) 
    for (int k=1;k<=m;k++)
	f[i][k]=l[i][k]=r[i][k]=L[i][k]=R[i][k]=h[i][k]=0;
    for (int i=1;i<=n;i++)
    {
        emm=0;
        for (int k=1;k<=m;k++)
        if (a[i][k]) l[i][k]=emm;
        else emm=k,L[i][k]=0;
        emm=m+1;
        for (int k=m;k>=1;k--)
        if (a[i][k]) r[i][k]=emm;
        else emm=k,R[i][k]=m+1;
    }
    for (int i=1;i<=m;i++) R[0][i]=m+1;
    for (int i=1;i<=n;i++)
    for (int k=1;k<=m;k++)
    if (a[i][k])
    {
        f[i][k]=min(f[i-1][k-1],min(f[i-1][k],f[i][k-1]))+1;
        h[i][k]=h[i-1][k]+1;
        L[i][k]=max(L[i-1][k],l[i][k]);
        R[i][k]=min(R[i-1][k],r[i][k]);
        ans=max(ans,f[i][k]*f[i][k]);
        que=max(que,h[i][k]*(R[i][k]-L[i][k]-1));
    }
    return ;
}
inline int read()
{
	int x=0;char ch=getchar();
	while (ch>'9'||ch<'0') ch=getchar();
	while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
	return x;
}
int main()
{
    n=read();m=read();
    for (int i=1;i<=n;i++)
    for (int k=1;k<=m;k++)
    {
        cin>>a[i][k];
        if ((i+k)%2!=1) a[i][k]^=1;
    }
   	slove();
    for (int i=1;i<=n;i++)
    for (int k=1;k<=m;k++)
    a[i][k]^=1;
    slove();
    cout<<ans<<endl<<que;
    return 0;
}