TYVJ 1939 「Poetize4」玉蟾宫

背景
有一天，小猫rainbow和freda来到了湘西张家界的天门山玉蟾宫，玉蟾宫宫主蓝兔盛情地款待了它们，并赐予它们一片土地。

---

【题目分析】
单调栈模板题目。用递推计算最长延伸高度。

---

【代码】

#include <cstdio>
#include <iostream>
using namespace std;
const int MAX_N = 100005;
int deep[1001], stack[1001], A[1001], n,m;
int map[1001][1001];
int h[1001][1001];
char ch;
int main()
{
    int out=0;
    scanf("%d%d",&m,&n);
    for (int i=1;i<=m;++i)
        for (int j=1;j<=n;++j)
        {
            cin>>ch;
            if (ch=='F') map[i][j]=1;
        }
    for (int i=1;i<=m;++i)
        for (int j=1;j<=n;++j)
            if (map[i][j]) h[i][j]=h[i-1][j]+1;
    for (int j=1;j<=m;++j)
    {
        for (int i = 1; i <= n; i++)
            A[i]=h[j][i];
        A[n+1] =0;n++;
        stack[0] = 0;
        int ans = 0;
        deep[0] = 0;
        int top = 1;
        for (int i = 1; i <= n; i++)
        {
            int depth = i;
            while (A[i] < stack[top-1])
            {
                int tmp = (int)(i - deep[top-1]) * (int)stack[top-1];
                if (tmp > ans) ans = tmp;
                depth = deep[top-1];
                top --;
            }
            if (A[i] > stack[top-1])
            {
                stack[top] = A[i];
                deep[top] = depth;
                top ++;
            }
        }
        out=max(ans,out);
        n--;
    }
    printf("%d\n",out*3);
}