Submission #1964847

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int H, W;
int cum_sum[101][101];

void add(int y, int x, int d){
	y += 1;
	x += 1;
	cum_sum[y][x] += d;
}

void build(void){
	for (int i = 1; i <= H; ++i){
		for (int j = 1; j <= W; ++j){
			cum_sum[i][j] += cum_sum[i][j-1] + cum_sum[i-1][j] - cum_sum[i-1][j-1];
		} // end for
	} // end for
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	memset(cum_sum, 0, sizeof(cum_sum));

	cin >> H >> W;
	rep (i, H){
		rep (j, W){
			int c; cin >> c;
			if ((i + j) % 2 == 0){
				add(i,j,c);
			}else{
				add(i,j,-c);
			} // end if
		} // end rep
	} // end rep
	build();

	int res = 0;
	for (int i = 1; i <= H; ++i){
		for (int j = 1; j <= W; ++j){
			for (int k = i; k <= H; ++k){
				for (int l = j; l <= W; ++l){
					int curr = cum_sum[k][l] - cum_sum[i-1][l] - cum_sum[k][j-1] + cum_sum[i-1][j-1];
					if (curr == 0){
						res = max(res, (k - i + 1) * (l - j + 1));
					} // end if
				} // end for
			} // end for
		} // end for
	} // end for

	cout << res << endl;
			
	return 0;
}

Submission Info

Judge Result