洛谷 1169 棋盘制作 DP

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

题解：一开始一直在想怎么处理间隔。发现题解是按照奇偶取反转换成了玉蟾宫，……真的很巧妙，求正方形就是取矩形较小的边平方

代码：

#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=2005;
int a[maxn][maxn],h[maxn][maxn],l[maxn][maxn],r[maxn][maxn],L[maxn][maxn],R[maxn][maxn];
int n,m;

int main()
{
	int i,j;
	int ans1=0,ans2=0;
	int bian;
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			scanf("%d",&a[i][j]);
			if((i+j)&1)a[i][j]=1-a[i][j];
		}
	}
	int t;
	for(i=1;i<=n;i++){
		t=0;
		for(j=1;j<=m;j++){
			if(a[i][j])l[i][j]=t;
			else L[i][j]=0,t=j;
		}
		t=m+1;
		for(j=m;j>0;j--){
			if(a[i][j])r[i][j]=t;
			else R[i][j]=m+1,t=j;
		}
	}
	for(i=0;i<=m+1;i++)R[0][i]=m+1;
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			if(a[i][j]){
				h[i][j]=h[i-1][j]+1;
				L[i][j]=max(l[i][j]+1,L[i-1][j]);
				R[i][j]=min(r[i][j]-1,R[i-1][j]);
				bian=min(R[i][j]-L[i][j]+1,h[i][j]);
				ans2=max(ans2,bian*bian);
				ans1=max(ans1,(R[i][j]-L[i][j]+1)*h[i][j]);
			}
		}
	}
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
			l[i][j]=r[i][j]=L[i][j]=R[i][j]=h[i][j]=0;//初始化
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)a[i][j]=1-a[i][j];
	for(i=1;i<=n;i++){
		t=0;
		for(j=1;j<=m;j++){
			if(a[i][j])l[i][j]=t;
			else L[i][j]=0,t=j;
		}
		t=m+1;
		for(j=m;j>0;j--){
			if(a[i][j])r[i][j]=t;
			else R[i][j]=m+1,t=j;
		}
	}
	for(i=0;i<=m+1;i++)R[0][i]=m+1;
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			if(a[i][j]){
				h[i][j]=h[i-1][j]+1;
				L[i][j]=max(l[i][j]+1,L[i-1][j]);
				R[i][j]=min(r[i][j]-1,R[i-1][j]);
				bian=min(R[i][j]-L[i][j]+1,h[i][j]);
				ans2=max(ans2,bian*bian);
				ans1=max(ans1,(R[i][j]-L[i][j]+1)*h[i][j]);
			}
		}
	}
	printf("%d\n%d\n",ans2,ans1);
	return 0;
}