bzoj3039: 玉蟾宫

题面在这里
呐这已经是水题again and again and again了呜哇...

做法：
单调栈。和51nod1158全是1的最大子矩阵一样的。。。
嘛单调栈的原理我就不讲了叭= =毕竟这也不是算法详解QwQ

/*************************************************************
    Problem: bzoj 3039 玉蟾宫
    User: fengyuan
    Language: C++
    Result: Accepted
    Time: 808 ms
    Memory: 5244 kb
    Submit_Time: 2017-12-15 18:43:47
*************************************************************/

#include<bits/stdc++.h>
#define rep(i, x, y) for (int i = (x); i <= (y); i ++)
#define down(i, x, y) for (int i = (x); i >= (y); i --)
#define mid ((l+r)/2)
#define lc (o<<1)
#define rc (o<<1|1)
#define pb push_back
#define mp make_pair
#define PII pair<int, int>
#define F first
#define S second
#define B begin()
#define E end()
using namespace std;
typedef long long LL;
//head

const int N = 1005;
int n, m;
int a[N][N], st[N], L[N], R[N];
char ch[3];

int main()
{
    scanf("%d%d", &n, &m);
    rep(i, 1, n) rep(j, 1, m){
        scanf("%s", ch);
        if (ch[0] == 'F') a[i][j] = a[i][j-1]+1;
    } int ans = 0;
    rep(j, 1, m){
        int top = 0; st[top] = 0;
        rep(i, 1, n){
            while (top && a[st[top]][j] >= a[i][j]) top --;
            L[i] = st[top]; st[++ top] = i;
        }
        st[top = 0] = n+1;
        down(i, n, 1){
            while (top && a[st[top]][j] >= a[i][j]) top --;
            R[i] = st[top]; st[++ top] = i;
        }
        rep(i, 1, n) ans = max(ans, (R[i]-L[i]-1)*a[i][j]);
    }
    printf("%d\n", ans*3);
    return 0;
}