传送门(洛谷)
算法:动态规划
相似例子:(洛谷)玉蟾宫,(洛谷)最大正方形
l
[
i
]
[
j
]
l[i][j]
l[i][j]表示从
m
a
p
p
[
i
]
[
j
]
mapp[i][j]
mapp[i][j]向左最大可延伸多少的点
r
[
i
]
[
j
]
r[i][j]
r[i][j]表示从
m
a
p
p
[
i
]
[
j
]
mapp[i][j]
mapp[i][j]向右最大可以延伸的点
u
p
[
i
]
[
j
]
up[i][j]
up[i][j]表示从
m
a
p
p
[
i
]
[
j
]
mapp[i][j]
mapp[i][j]向上最大的距离
转移方程式
l
[
i
]
[
j
]
=
l
[
i
]
[
j
−
1
]
;
l[i][j]=l[i][j-1];
l[i][j]=l[i][j−1];
r
[
i
]
[
j
]
=
r
[
i
]
[
j
−
1
]
;
r[i][j]=r[i][j-1];
r[i][j]=r[i][j−1];
Code
#include<bits/stdc++.h>
#define rep(i,a,b) for(register int i=(a);i<=(b);i++)
#define don(i,a,b) for(register int i=(a);i>=(b);i--)
#define ll long long
using namespace std;
const int maxn=2e5+10;
const int maxm=2e3+10;
int n,m;
bool mapp[maxm][maxm];
int l[maxm][maxm],r[maxm][maxm],up[maxm][maxm];
template <class t> inline void read(t &x)
{
int f=1;x=0;char ch=getchar();
while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
while(isdigit(ch)){x=10*x+ch-'0';ch=getchar();}
x*=f;
}
void readdata() {
read(n);read(m);
rep(i,1,n)
rep(j,1,m) {
read(mapp[i][j]);
l[i][j]=r[i][j]=j;
up[i][j]=1;
}
}
void work() {
rep(i,1,n)
rep(j,2,m) {
if(mapp[i][j]!=mapp[i][j-1])
l[i][j]=l[i][j-1];
}
rep(i,1,n)
for(int j=m-1;j>=1;j--) {
if(mapp[i][j]!=mapp[i][j+1])
r[i][j]=r[i][j+1];
}
int ans1=0,ans2=0,a=0,b=INT_MAX;
rep(i,1,n)
rep(j,1,m) {
if(i>1 && mapp[i][j]!=mapp[i-1][j]) {
l[i][j]=max(l[i][j],l[i-1][j]);//要从小的编号开始,否则会将不合法的也算上,要尽量靠右,画图看看
r[i][j]=min(r[i][j],r[i-1][j]);//向右延伸需要延伸更小的
up[i][j]=up[i-1][j]+1;//前缀和找出最大的延伸
}
a=r[i][j]-l[i][j]+1;//当前宽度
b=min(up[i][j],a);//当前宽度的长度
ans1=max(ans1,b*b);//用ans保留最大的矩形和正方形
ans2=max(ans2,a*up[i][j]);
}
printf("%d\n%d",ans1,ans2);
}
int main() {
freopen("input.txt","r",stdin);
readdata();
work();
return 0;
}