Submission #2744104

---

Source Code Expand

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

S = [[0] * (W+1) for i in range(H+1)]
for i in range(H):
    for j in range(W):
        if (i+j) % 2 == 0:
            S[i+1][j+1] = C[i][j]
        else:
            S[i+1][j+1] = -C[i][j]

# 2次元累積和
for i in range(2, H+1):
    S[i][1] += S[i-1][1]
for i in range(2, W+1):
    S[1][i] += S[1][i-1]

for i in range(2, H+1):
    for j in range(2, W+1):
        S[i][j] = S[i][j] + S[i-1][j] + S[i][j-1] - S[i-1][j-1]

# 答えを計算
ans = 0
for i in range(1, H+1):
    for j in range(1, W+1):
        for k in range(i, H+1):
            for l in range(j, W+1):
                if S[k][l] - S[k][j-1] - S[i-1][l] + S[i-1][j-1] == 0:
                    ans = max(ans, (k-i+1)*(l-j+1))
print(ans)

Submission Info

Judge Result