Submission #1839280

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "cmath"

using namespace std;

const long long int MOD = 1000000007;

long long int N, M, K, H, W, L, R;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> H >> W;
	vector<vector<int>>v(H+1, vector<int>(W+1));
	for (int i = 1; i <= H; i++) {
		for (int j = 1; j <= W; j++) {
			cin >> v[i][j];
			if ((i + j) % 2) {
				v[i][j] *= -1;
			}
		}
	}
	for (int i = 1; i <= H; i++) {
		for (int j = 2; j <= W; j++) {
			v[i][j] += v[i][j - 1];
		}
	}
	for (int i = 2; i <= H; i++) {
		for (int j = 1; j <= W; j++) {
			v[i][j] += v[i - 1][j];
		}
	}
	int ans = 0;
	for (int i = 1; i <= H; i++) {
		for (int j = i; j <= H; j++) {
			for (int k = 1; k <= W; k++) {
				for (int l = k; l <= W; l++) {
					M = v[j][l];
					M += v[i - 1][k - 1];
					M -= v[i - 1][l];
					M -= v[j][k - 1];
					if (!M) {
						ans = max(ans, (j - i + 1)*(l - k + 1));
					}
				}
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result