参考《浅谈用极大化思想解决最大子矩形问题》–王知昆
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<bitset>
using namespace std;
int h[1100][1100];
int l[1100][1100],r[1100][1100];
int n,m;
int mp[1100][1100];
int ans;
int main()
{
scanf("%d %d",&n,&m);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
char x;
while(1)
{
x=getchar();
if (x=='F'||x=='R') break;
}
if (x=='R') mp[i][j]=1;
}
int t;
for (int i=1;i<=n;i++)
{
t=1;
for (int j=1;j<=m;j++)
if (!mp[i][j]) l[i][j]=t;
else l[i][j]=1,t=j+1;
}
for (int i=1;i<=n;i++)
{
t=m;
for (int j=m;j>=1;j--)
if (!mp[i][j]) r[i][j]=t;
else r[i][j]=m,t=j-1;
}
for (int i=1;i<=m;i++)
l[0][i]=1,r[0][i]=m;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
if (!mp[i][j])
{
h[i][j]=h[i-1][j]+1;
l[i][j]=max(l[i][j],l[i-1][j]);
r[i][j]=min(r[i][j],r[i-1][j]);
ans=max(ans,(r[i][j]-l[i][j]+1)*h[i][j]);
}
printf("%d\n",3*ans);
return 0;
}