uvaLA 3029 最大子矩阵（DP）

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;

int maps[1100][1100];
int N, M;
int high[1100][1100], lf[1100][1100], rt[1100][1100];

int main(){
int T, ans;
char c;

scanf( "%d", &T );
while( T-- ){

scanf( "%d%d", &N, &M );
memset( maps, 0, sizeof( maps ) );
for( int i = 1; i <= N; i++ ){
for( int j = 1; j <= M; j++ ){
while( 1 ){
c = getchar();
if( c == 'R' ){
maps[i][j] = 0;
break;
}else if( c == 'F' ){
maps[i][j] = 1;
break;
}
}
}
}

ans = 0;
memset( high, 0, sizeof( high ) );
for( int i = 1; i <= N; i++ ){
lf[i][0] = 0;
for( int j = 1; j <= M; j++ ){
if( maps[i][j] ){
lf[i][j] = lf[i][j-1] + 1;
}else{
lf[i][j] = 0;
}
}
rt[i][M+1] = 0;
for( int j = M; j >= 1; j-- ){
if( maps[i][j] ){
rt[i][j] = rt[i][j+1] + 1;
}else{
rt[i][j] = 0;
}
}
for( int j = 1; j <= M; j++ ){
if( maps[i][j] == 0 ){
high[i][j] = 0;
continue;
}else if( maps[i-1][j] == 0 ){
high[i][j] = 1;
ans = max( ans, lf[i][j] + rt[i][j] - 1 );
}else{
high[i][j] = high[i-1][j] + 1;
lf[i][j] = min( lf[i-1][j], lf[i][j] );
rt[i][j] = min( rt[i-1][j], rt[i][j] );
ans = max( ans, ( lf[i][j] + rt[i][j] - 1 ) * high[i][j] );
}
}
}

printf( "%d\n", ans * 3 );
}
return 0;
}