这道题实质是HDU1506的二维版dp http://blog.csdn.net/Andymion/article/details/53443988
在给定的矩形中选取最大的矩形,其中有些地方是被占据的,不能选取。
以行为开始依次寻找,首先预处理当前块能向上延伸的长度,然后一维处理它的长度下左右延伸的宽度。
#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn = 1000 + 10;
int n, m;
char land[maxn][maxn];
int a[maxn][maxn], L[maxn], R[maxn];
void init(){
for(int i = 1; i <= m; ++i)
L[i] = R[i] = i;
}
int main()
{
ios::sync_with_stdio(false);
int T;
cin >> T;
while(T --){
memset(a, -1, sizeof(a));
cin >> n >> m;
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= m; ++j){
cin >> land[i][j];
}
}
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= m; ++j){
a[i][j] = (land[i][j] == 'F' ? 1 : 0);
}
}
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= m; ++j){
if(a[i - 1][j] != 0 && a[i][j]){
if(a[i - 1][j] == -1) a[i][j] = 1;
else a[i][j] = a[i - 1][j] + 1;
}
}
}
int maxs = 0;
for(int i = 1; i <= n; ++i){
init();
for(int j = 1; j <= m; ++j){
if(a[i][j - 1] >= a[i][j]){
while(a[i][L[j] - 1] >= a[i][j]){
L[j] = L[L[j] - 1];
}
}
}
for(int j = m; j >= 1; --j){
if(a[i][j + 1] >= a[i][j]){
while(a[i][R[j] + 1] >= a[i][j]){
R[j] = R[R[j] + 1];
}
}
}
for(int j = 1; j <= m; ++j){
maxs = max(maxs, a[i][j] * (R[j] - L[j] + 1));
}
}
cout << maxs * 3 << endl;
}
return 0;
}