Submission #1390021

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back

using pii = pair<int, int>;
using vi = vector<int>;
using lint = long long;

const int inf = 1001001001;
const lint linf = 1001001001001001001ll;
const int mod = 1e9 + 7;
const int dx[]{0, 1, 0, -1, -1, -1, 1, 1}, dy[]{1, 0, -1, 0, -1, 1, -1, 1};

template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; } return a > b; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; } return a < b; }
template<typename T> inline void print(const T &x, string s = "\n") { cout << x << s; }
template<typename T> inline void print(const vector<T> &v, string s = " ") 
{ rep(i, v.size()) cout << v[i] << (i + 1 == v.size() ? "\n" : s); }
inline bool inside(int y, int x, int H, int W) { return 0 <= y && y < H && 0 <= x && x < W; }
inline lint in() { lint x; std::cin>>x; return x; }

int a[101][101];

int main() {
	int h = in(), w = in();

	rep(i, h) rep(j, w) a[i + 1][j + 1] = in() * (i + j & 1 ? -1 : 1);

	rep(i, h + 1) rep(j, w) a[i][j + 1] += a[i][j];
	rep(i, h) rep(j, w + 1) a[i + 1][j] += a[i][j];

	int ans = 0;
	for (int i = 1; i <= h; ++i) {
		for (int j = 1; j <= w; ++j) {
			rep(k, h - i + 1) rep(l, w - j + 1) {
				if (a[k][l] + a[k + i][l + j] - a[k][l + j] - a[k + i][l] == 0) {
					chmax(ans, i * j);
				}
			}
		}
	}

	print(ans);
}

Submission Info

Judge Result