https://www.luogu.org/problemnew/show/P4147
题意:寻找面积最大的由F构成的子矩阵
题解:悬线法模板题
代码:
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=1005;
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;
char ch;
int ans=0;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
cin>>ch;
if(ch=='F')a[i][j]=1;
else a[i][j]=0;
}
}
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;
}
}
for(i=1;i<=n;i++){
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,L[0][i]=0;
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-1][j],l[i][j]+1);
R[i][j]=min(R[i-1][j],r[i][j]-1);
ans=max(ans,3*(R[i][j]-L[i][j]+1)*h[i][j]);
}
}
}
cout << ans << endl;
return 0;
}