Submission #1964811

---

Source Code Expand

H,W = map(int,input().split())
C = []
for i in range(H):
	C.append(list(map(int,input().split())))

cum_sum = [[0 for i in range(W+1)] for _ in range(H+1)]

def add(y, x, d):
	global cum_sum
	x += 1
	y += 1
	cum_sum[y][x] += d

def build():
	global H, W, cum_sum
	for i in range(1, H+1):
		for j in range(1, W+1):
			cum_sum[i][j] += cum_sum[i][j-1] + cum_sum[i-1][j] - cum_sum[i-1][j-1]

for i in range(H):
	for j in range(W):
		if (i + j) % 2 == 0:
			add(i, j, C[i][j])
		else:
			add(i, j, -C[i][j])
build()

res = 0
for i in range(1,H+1):
	for j in range(1,W+1):
		for k in range(i,H+1):
			for m in range(j,W+1):
				curr = cum_sum[k][m] - cum_sum[i-1][m] - cum_sum[k][j-1] + cum_sum[i-1][j-1]
				if curr == 0:
					res = max(res, (k - i + 1) * (m - j + 1))

print(res)

Submission Info

Judge Result