AcWing 152. 城市游戏
原题链接
中等
作者:
grairain
,
2021-05-18 21:18:02
,
所有人可见
,
阅读 230
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1010;
int n, m;
int g[N][N];
int h[N][N];
int q[N], l[N], r[N];
int work(int h[]) {
h[0] = h[m + 1] = -1;
int tt = 0;
q[0] = 0;
for(int i = 1; i <= m; i ++ ) {
while(h[i] <= h[q[tt]]) tt --;
l[i] = q[tt];
q[++ tt] = i;
}
tt = 0;
q[0] = m + 1;
for(int i = m; i >= 1; i -- ) {
while(h[i] <= h[q[tt]]) tt --;
r[i] = q[tt];
q[++ tt] = i;
}
int res = 0;
for(int i = 1; i <= m; i ++ ) {
res = max(res, h[i] * (r[i] - l[i] - 1));
}
return res;
}
int main()
{
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i ++ ) {
for(int j = 1; j <= m; j ++ ) {
char c;
cin >> c;
if(c == 'F') h[i][j] = h[i - 1][j] + 1;
}
}
int res = 0;
for(int i = 0; i <= n; i ++ ) {
res = max(res, work(h[i]));
}
printf("%d", 3 * res);
return 0;
}