UVa 1330 LA 3029

蓝书第一章的题目，神奇的解法：详细见P50，City Game LA3029， UVa 1330

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
const int maxn = 1001;
int kase, n, m, mat[maxn][maxn], up[maxn][maxn], l[maxn][maxn], r[maxn][maxn];

int main() {
    scanf("%d", &kase);
    while(kase--) {
        scanf("%d%d", &n, &m);
        for(int i = 0; i < n; ++i) {
            for(int j = 0; j < m; ++j) {
                char s[2]; scanf("%s", s);
                if(s[0] == 'F') mat[i][j] = 0;
                else mat[i][j] = 1;
            }
        }
        int ans = 0;
        for(int i = 0; i < n; ++i) {
            int lo = -1, ro = m;
            for(int j = 0; j < m; ++j) {
                if(mat[i][j] == 1) { up[i][j] = l[i][j] = 0; lo = j; }
                else {
                    up[i][j] = i == 0 ? 1 : up[i-1][j]+1;
                    l[i][j] = i == 0 ? lo+1 : max(l[i-1][j], lo+1);
                }
            }
            for(int j = m-1; j >= 0; --j) {
                if(mat[i][j] == 1) { r[i][j] = m; ro = j; }
                else {
                    r[i][j] = i == 0 ? ro-1 : min(r[i-1][j], ro-1);
                    ans = max(ans, up[i][j]*(r[i][j]-l[i][j]+1));
                }
            }
        }
        printf("%d\n", ans*3);
    }
}