Submission #1350291

---

Source Code Expand

#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>

using namespace std;

#ifndef _DEBUG
#define main_ main
#endif
#define FOR(i,s,e) for (int i = int(s); i < int(e); ++i)
#define REP(i,e) FOR(i,0,e)
#define INF (INT_MAX/2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX/2)

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<string> vs;

template <typename T>
using keyVal = pair<string, T>;
template<typename T>
bool val_greater(const keyVal<T>& left, const keyVal<T>& right) {
	return left.second > right.second;
}

vs split(string str, char sep) {
	vs v; stringstream ss(str); string t;
	while (getline(ss, t, sep)) v.push_back(t);
	return v;
}

void init_global() {}

int main_() {
	cin.tie(0);
	ios::sync_with_stdio(false);
#ifndef _DEBUG
	init_global();
#endif

	int H,W; cin >> H>>W;
	vvi C(H, vi(W)); 
	FOR(i, 0, H) {
		FOR(j, 0, W) {
			cin >> C[i][j];
		}
	}

	int ans = 0;
	FOR(u, 0, H) {
		FOR(d, u, H) {
			FOR(l, 0, W) {
				FOR(r, l, W) {

					int b = 0, w = 0;
					FOR(i, u, d+1) {
						FOR(j, l, r+1) {
							if ((i + j) % 2 == 0) b += C[i][j];
							else w += C[i][j];
						}
					}
					if (b == w) ans = max(ans, (d-u+1)*(r-l+1));

				}
			}
		}
	}

	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result