[悬线法] BZOJ 3039 玉蟾宫

《浅谈用极大化思想解决最大子矩形问题》王知昆

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
typedef pair<int,int> abcd;

inline char nc()
{
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
	return *p1++;
}

inline void read(int &x)
{
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

inline void read(char &x)
{
	for (x=nc();x!='R' && x!='F';x=nc());
}

int n,m,cnt,ans;
char M[1005][1005];
abcd P[1000005];
int height[1005][1005],left[1005][1005],right[1005][1005];

int main()
{
	int it,tmp;
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	read(n); read(m);
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
		{
			read(M[i][j]);
			if (M[i][j]=='R')
				P[++cnt]=abcd(i,j);
		}
	P[++cnt]=abcd(0,0),P[++cnt]=abcd(n+1,n+1);
	sort(P+1,P+cnt+1);
	for (int j=1;j<=m;j++)
		height[0][j]=0,left[0][j]=1,right[0][j]=m;
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
		{
			if (M[i][j]=='F')
			{
				height[i][j]=height[i-1][j]+1;
				it=lower_bound(P+1,P+cnt+1,abcd(i,j))-P-1;
				if (P[it].first<i) tmp=0; else tmp=P[it].second;
				left[i][j]=max(left[i-1][j],tmp+1);
				it=lower_bound(P+1,P+cnt+1,abcd(i,j))-P;
				if (P[it].first>i) tmp=m+1; else tmp=P[it].second;
				right[i][j]=min(right[i-1][j],tmp-1);
			}
			else 
			{
				height[i][j]=0;
				left[i][j]=1;
				right[i][j]=m;
			}				
		}
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
			ans=max(ans,height[i][j]*(right[i][j]-left[i][j]+1));
	printf("%d\n",3*ans);
	return 0;
}