记录编号	353352	评测结果	AAAAAAAAAA
题目名称	1237.[Nescafé 20] 玉蟾宫	最终得分	100
用户昵称	sxysxy	是否通过	通过
代码语言	C++	运行时间	0.187 s
提交时间	2016-11-17 22:18:23	内存使用	12.71 MiB

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <list>
#include <queue>
#include <vector>
#include <cmath>
#include <cctype>
using namespace std;
int U[1001][1001];
int R[1001][1001];
int L[1001][1001];
char mpp[1001][1001];
int fast_read()
{
    int r;
    char c;
    while(c = getchar())
    {
        if(c >= '0' && c <= '9')
        {
            r = c^0x30;
            break;
        }
    }
    while(isdigit(c = getchar()))
        r = (r<<3)+(r<<1)+(c^0x30);
    return r;
}
int main()
{
    freopen("jademoon.in", "r", stdin);
    freopen("jademoon.out", "w", stdout);
    int n, m;
    n = fast_read();
    m = fast_read();
    int ans = 0;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
        {
            char c;
            while(!isalpha(c = getchar()));
            if(c == 'R')mpp[i][j] = 1;
        }
    for(int i = 0; i < n; i++)
    {
        int lo = -1, ro = m;
        for(int j = 0; j < m; j++)
        {
            if(mpp[i][j])
            {
                U[i][j] = L[i][j] = 0;
                lo = j;
            }else
            {
                U[i][j] = i?(U[i-1][j]+1):1;
                L[i][j] = i?max(L[i-1][j], lo+1):lo+1;
            }
        }
        for(int j = m-1; j >= 0; j--)
        {
            if(mpp[i][j])
            {
                R[i][j] = m+1;
                ro = j;
            }else
            {
                R[i][j] = i?min(R[i-1][j], ro-1):ro-1;
                ans = max(ans, U[i][j]*(R[i][j]-L[i][j]+1));
            }
        }
    }
    printf("%d\n", ans*3);
    return 0;
}