点击查看代码
#include <iostream>
using namespace std;const int N = 1005;
int n, pre[N][N], ans;int main() {cin >> n;for (int i = 1; i <= n; i++) {for (int j = 1; j <= n; j++) {int x;cin >> x;pre[i][j] = pre[i-1][j] + pre[i][j-1] - pre[i-1][j-1] + x;if (pre[i][j] == 0) {ans = max(ans, i * j);}}}cout << ans << endl;return 0;
}
