65pts求调必关码风良好思路清晰

#include<bits/stdc++.h>
using namespace std;
const int N=1005;
char c[N][N];
int a[N][N],s[N];
int main(){
	int n,m,top=0,ans=0;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		top=0;
		for(int j=1;j<=m;j++){
			cin>>c[i][j];
			if(c[i][j]=='F'){
				a[i][j]=a[i-1][j]+1;
			}
			else a[i][j]=0;
			while(top&&a[i][j]<=a[i][s[top]]) top--;
			ans=max(ans,a[i][j]*(j-s[top]));
			s[++top]=j;
		}
	}
	cout<<3*ans;
	return 0;
}