SEERC 2004,LA 3029最大子矩阵

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1000;
int mat[maxn][maxn],up[maxn][maxn],Left[maxn][maxn],Right[maxn][maxn];
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		int m,n;
		cin>>m>>n;
		for(int i=0;i<m;i++)
			for(int j=0;j<n;j++)
			{
				int ch = getchar();
				while(ch!='F' && ch!='R') ch = getchar();
				mat[i][j] = ch == 'F' ? 0 : 1;
			}
			int ans = 0;
			for(int i=0;i<m;i++)		//从上到下遍历
			{
				int lo = -1,ro = n;		//初始化两个都是越界的情况
				for(int j=0;j<n;j++)		//从左到右扫描,维护up和left
				{
					if(mat[i][j] == 1) {up[i][j] = Left[i][j] = 0;lo = j;}		//左边的障碍格为 lo = j;
					else
					{
						up[i][j] = i == 0 ? 1 : up[i-1][j] + 1;		
						Left[i][j] = i == 0 ? lo+1 : max(Left[i-1][j],lo+1);	//左边的障碍(lo) - 1即为(F)空白
					}
					for(int j = n-1;j>=0;j--)
					{
						if(mat[i][j] == 1) {Right[i][j] = n;ro = j;}		//右边的障碍为ro.
						else
						{
							Right[i][j] = i == 0 ? ro-1 :min(Right[i][j],ro-1);	//右边的障碍(ro) - 1即为F(空白)
							ans = max(ans,up[i][j] * (Right[i][j] - Left[i][j] + 1));	//(Right - Left) + 1即为矩形的一边
						}
					}
				}
			}

<span style="white-space:pre">			</span>cout<<ans*3<<endl;
	}

}