Submission #1301951

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int H, W;
vector<vector<int>> c;

bool is_zero(int ih, int it, int jh, int jt) {
	int sum = 0;
	for (int i = ih; i <= it; i++) {
		for (int j = jh; j <= jt; j++) {
			sum += c[i][j];
		}
	}

	return sum == 0;
}

int solver() {
	int ans = 0;

	for (int i1 = 0; i1 < H; i1++) {
		for (int i2 = i1; i2 < H; i2++) {
			for (int j1 = 0; j1 < W; j1++) {
				for (int j2 = j1; j2 < W; j2++) {
					if (is_zero(i1, i2, j1, j2)) {
						ans = max(ans, (i2 - i1 + 1) * (j2 - j1 + 1));
					}
				}
			}
		}
	}

	return ans;
}

int main() {
	cin >> H >> W;
	c.resize(H);

	for (int i = 0; i < H; i++) {
		bool tmp1 = (i % 2 == 0);
		c[i].resize(W);

		for (int j = 0; j < W; j++) {
			bool tmp2 = (j % 2 == 0);
			cin >> c[i][j];

			if (tmp1 == tmp2) {
				c[i][j] *= -1;
			}
		}
	}

	cout << solver() << endl;
}

Submission Info

Judge Result