Submission #183493

---

Source Code Expand

#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <iterator>

using namespace std;
const int MOD = 1000000007; // check!!!
const int INF = 100000000; //1e8

typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)
#define tenll(x) ((ll)1e##x)

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }

int h, w;
int a[101][101];
int b[101][101];

int main() {
	cin >> h >> w;
	FOR(i, h) FOR(j, w) cin >> a[i][j];
	FOR(i, h) FOR(j, w) {
		int add = a[i][j];
		if ((i + j) % 2 == 1) add *= -1;
		b[i + 1][j + 1] = b[i + 1][j] + b[i][j + 1] - b[i][j] + add;
	}

	int ans = 0;
	FOR(i, h) FOR(j, w) {
		for (int k = i + 1; k <= h; k++) {
			for (int l = j + 1; l <= w; l++) {
				int val = b[k][l] - b[i][l] - b[k][j] + b[i][j];
				if (val == 0) ans = max(ans, (k - i)*(l - j));
			}
		}
	}
	cout << ans << endl;
}

Submission Info

Judge Result