http://acm.hdu.edu.cn/showproblem.php?pid=1505

标记，枚举+迭代。。。。

#include<iostream>
#include<string.h>
#include<algorithm>
#define N 1001
using namespace std;
bool map[N][N];
int dp[N][N];
int s[N];
int l[N],r[N];
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		int n,m;
		 cin>>n>>m;
		 for(int i=1;i<=n;++i)
			 for(int j=1;j<=m;++j)
			 {   char ch;
		         cin>>ch;
				 if(ch=='R') map[i][j]=0;
				 else map[i][j]=1;
			 }
		  memset(dp,0,sizeof(dp));
		  memset(s,0,sizeof(s));
		  int maxx=0;
		   for(int j=1;j<=n;++j)
			  {
				  for(int i=1;i<=m;++i)
			      {  
				   if(map[j][i])  dp[j][i]=dp[j-1][i]+1;
		            s[i]=dp[j][i];
				    l[i]=r[i]=i;
		           }
		      s[0]=s[m+1]=-1;
		     for(int i=1;i<=m;++i)
			   while(s[l[i]-1]>=s[i]) l[i]=l[l[i]-1];
		    for(int i=m;i>=1;--i)
				while(s[r[i]+1]>=s[i]) r[i]=r[r[i]+1];
			     for(int i=1;i<=m;++i)
				   maxx=max(maxx,(r[i]-l[i]+1)*s[i]);
		     }
		   cout<<maxx*3<<endl;
	}return 0;
}