提出 #21587644

---

ソースコード 拡げる

#da[i][j]:(0,0)~(i,j)の長方形の和
def da_generate(h,w,a):
    da = [[0]*w for j in range(h)]
    da[0][0] = a[0][0]
    for i in range(1,w):
        da[0][i] = da[0][i-1]+a[0][i]
    for i in range(1,h):
        cnt_w = 0
        for j in range(w):
            cnt_w += a[i][j]
            da[i][j] = da[i-1][j]+cnt_w
    return da

#da_calc(p,q,x,y):(p,q)~(x,y)の長方形の和
def da_calc(p,q,x,y):
    if p > x or q > y:
        return 0
    if p == 0 and q == 0:
        return da[x][y]
    if p == 0:
        return da[x][y]-da[x][q-1]
    if q == 0:
        return da[x][y]-da[p-1][y]
    return da[x][y]-da[p-1][y]-da[x][q-1]+da[p-1][q-1]

#input
h,w = map(int,input().split())
choco = [list(map(int,input().split())) for i in range(h)]
for i in range(h):
    for j in range(w):
        if (i+j)%2==1:
            choco[i][j] *=-1
ans = 0
da = da_generate(h,w,choco)
for p in range(h):
    for q in range(w):
        for x in range(p,h):
            for y in range(q,w):
                if da_calc(p,q,x,y)==0:
                    ans = max(ans,(x-p+1)*(y-q+1))
print(ans)

提出情報

ジャッジ結果