Submission #2867481

---

Source Code Expand

H,W = map(int,input().split())
C = [[int(i) for i in input().split()] for i in range(H)]
bl,wh = [[0 for i in range(W+2)] for i in range(H+2)],[[0 for i in range(W+2)] for i in range(H+2)]
for i in range(1,H+1):
    for j in range(1,W+1):
        if (i+j)%2==0:
            bl[i][j] = C[i-1][j-1]+bl[i-1][j]+bl[i][j-1]-bl[i-1][j-1]
            wh[i][j] = wh[i-1][j]+wh[i][j-1]-wh[i-1][j-1]
        else:
            bl[i][j] = bl[i-1][j]+bl[i][j-1]-bl[i-1][j-1]
            wh[i][j] = C[i-1][j-1]+wh[i-1][j]+wh[i][j-1]-wh[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 i==k and j==l:
                    white = wh[i][j]
                    black = bl[i][j]
                else:
                    white = wh[k][l]-wh[i-1][j+1]-wh[i+1][j-1]+C[i-1][j-1]
                    black = bl[k][l]-bl[i-1][j+1]-bl[i+1][j-1]+C[i-1][j-1]
                if white==black:
                    ans = max(ans, (k-i+1)*(l-j+1))
print(ans)

Submission Info

Judge Result