简答题
偏难
#20078
排兵布阵
排兵布阵


答案与解析
正确答案:<pre class="brush:cpp;toolbar:false;">#include <algorithm>
#include <cstdio>
using namespace std;
const int N = 15;
int n, m;
int a[N][N], col[N][N];
int ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
scanf("%d", &a[i][j]);
col[j][i] = col[j][i-1] + a[i][j]; // 第j列前缀和
}
for (int u = 1; u <= n; u++)
for (int l = 1; l <= m; l++)
for (int d = u; d <= n; d++) {
int chk = 1;
for (int r = l; r <= m; r++) {
// u~d行总和等于行数则全1
if (col[r][d] - col[r][u-1] != d - u + 1) {
chk = 0;
}
if (!chk) break;
ans = max(ans, (r - l + 1) * (d - u + 1));
}
}
printf("%d\n", ans);
return 0;
}</pre>
这道题暂未补解析。