1506的升级版?
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
using namespace std;
typedef long long LL;
const double pi = acos(-1.0);
const int maxn = 1000;
void init();
void solve();
void outp();
int dp[maxn + 10][maxn + 10], l[maxn + 10], r[maxn + 10];
int ans, a, b;
int main()
{
int n;
while (~scanf("%d", &n))
while (n--)
{
init();
solve();
outp();
//outp();
}
return 0;
}
void solve()
{
ans = 0;
for (int i = 0; i < a; i++)
{
for (int j = 0; j < b; j++)
{
l[j] = j;
while (l[j] > 0 && dp[i][l[j] - 1] >= dp[i][j])
{
l[j] = l[l[j] - 1];
}
}
for (int j = b - 1; j > -1; j--)
{
r[j] = j;
while (r[j] < b - 1 && dp[i][r[j] + 1] >= dp[i][j])
{
r[j] = r[r[j] + 1];
}
}
for (int j = 0; j < b; j++)
if (ans < ((r[j] - l[j] + 1)*dp[i][j]))
{
ans = ((r[j] - l[j] + 1) * dp[i][j]);
}
}
}
void init()
{
scanf("%d%d", &a, &b);
memset(dp, 0, sizeof(dp));
for (int i = 0; i < a; i++)
{
for (int j = 0; j < b; j++)
{
char c[2];
cin >> c;
if (c[0] == 'F')
{
dp[i][j] = 1;
}
}
}
for (int i = 1; i < a; i++)
for (int j = 0; j < b; j++)
if (dp[i][j] != 0)
{
dp[i][j] = dp[i - 1][j] + 1;
}
}
void outp()
{
printf("%d\n", ans * 3);
}