题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1505
首先这题我们可以先回顾一下另一道题HDOJ 1506 Largest Rectangle in a Histogram,这道题我们可以先想想,是不是很像呀~,但是可能层上还有层,所以我们就在一层一层的按上一题的贪心策略贪心过去就好。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1000+5;
int l[maxn],r[maxn],a[maxn][maxn];
char map[maxn][maxn];
int main()
{
int T,n,m;
scanf("%d",&T);
while(T--)
{
int Max = 0;
scanf("%d%d",&n,&m);
getchar();
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
cin >> map[i][j];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
if(map[i][j] == 'F')
a[i][j] = a[i-1][j]+1;
else a[i][j] = 0;
}
}
for(int i=1; i<=n; i++)
{
l[1] = 1,r[m] = m;
for(int j=2; j<=m; j++)
{
if(a[i][j] == 0) continue;
int tmp = j;
while(tmp>1 && a[i][j]<=a[i][tmp-1])
tmp = l[tmp-1];
l[j] = tmp;
}
for(int j=m-1; j>=1; j--)
{
if(a[i][j] == 0) continue;
int tmp = j;
while(tmp<m && a[i][j]<=a[i][tmp+1])
tmp = r[tmp+1];
r[j] = tmp;
}
for(int j=1; j<=m; j++)
Max = max((r[j]-l[j]+1)*a[i][j], Max);
}
printf("%d\n",Max*3);
}
return 0;
}