68分求条，玄关

#include<bits/stdc++.h>
using namespace std;
//map<类型,下标>a; 
int n,m,i,j,a[1001][1001],x[1001][1001],y[1001][1001],ma=0;
char ch;
int main()
{
 cin>>n>>m;
 for(i=1;i<=n;i++)
  for(j=1;j<=m;j++)
  {
   cin>>ch;
   if(ch=='F')a[i][j]=1;
   else a[i][j]=0;
  }
 for(i=1;i<=n;i++)
  for(j=1;j<=m;j++)
  {
   if(a[i][j]==0)
   {
    x[i][j]=y[i][j]=0;
	continue;
   }
    x[i][j]=min(x[i-1][j-1],min(x[i][j-1],x[i-1][j]))+1,
	y[i][j]=min(y[i-1][j-1],min(y[i][j-1],y[i-1][j]))+1;
   if((x[i][j-1]+1)>x[i][j]*y[i][j])
    x[i][j]=x[i][j-1]+1,y[i][j]=1;
   if((y[i-1][j]+1)>x[i][j]*y[i][j])
    x[i][j]=1,y[i][j]=y[i-1][j]+1;
   if(x[i][j]*y[i][j]>ma)ma=x[i][j]*y[i][j];
  }
 cout<<ma*3;
 return 0;
}