Submission #3633843

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
int white[100][100];
int black[100][100];
int main() {
	int H, W;
	cin >> H >> W;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			if ((i + j) % 2 == 0) cin >> black[i][j];
			else cin >> white[i][j];
		}
	}
	for (int i = 0; i < H; i++) {
		for (int j = 0; j + 1 < W; j++) {
			white[i][j + 1] += white[i][j];
			black[i][j + 1] += black[i][j];
		}
	}
	for (int i = 0; i + 1 < H; i++) {
		for (int j = 0; j < W; j++) {
			white[i + 1][j] += white[i][j];
			black[i + 1][j] += black[i][j];
		}
	}
	int ans = 0;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			for (int k = i; k < H; k++) {
				for (int l = j; l < W; l++) {
					int w = white[k][l];
					if (j > 0) w -= white[k][j - 1];
					if (i > 0) w -= white[i - 1][l];
					if (i > 0 && j > 0) w += white[i - 1][j - 1];
					int b = black[k][l];
					if (j > 0) b -= black[k][j - 1];
					if (i > 0) b -= black[i - 1][l];
					if (i > 0 && j > 0) b += black[i - 1][j - 1];
					if (b == w) {
						ans = max(ans, (k - i + 1)*(l - j + 1));
					}
				}
			}
		}
	}
	cout << ans << endl;
}

Submission Info

Judge Result