题意:有一个矩阵,上面有F和R,求最大由F组成的子矩阵的大小
N <= 1000
思路一:DP,4维,不可不可。
思路二:“二维滑动窗口”。自底向上,自左向右扫描,让len(i,j)表示往下到底F最长的长度,left(i,j),right(i,j)表示从右到左同样是len(i,j)能够扩展到多远。 有这样的状态转移:
len(i,j) = len(i-1,j) + 1。 left(i,j) = max(left(i-1,j),LEFT_BOUND) right(i,j) = (min(right(i-1,j),RIGHT_BOUND)
#include <bits/stdc++.h>
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);
}
}