提出 #6121292

---

ソースコード 拡げる

import numpy as np
H,W = map(int,input().split())

# 1列ずつ入れておく
C = np.zeros((H+1, W+1), dtype=np.int32)
C[1:, 1:] = [input().split() for _ in range(H)]

# 白を負に
C[1::2, ::2] *= (-1)
C[::2, 1::2] *= (-1)

# 2次元累積和
C_cum = C.cumsum(axis = 0).cumsum(axis = 1)

answer = 0
for j in range(1,W+1):
  # j列目から使い始める場合
  a = C_cum[:,j:] - C_cum[:,j-1][:,None]
  for i in range(1,H+1):
    X,Y = (a[i:] == a[i-1]).nonzero()
    if len(X) > 0:
      answer = max(answer, np.max((X+1)*(Y+1)))

print(answer)

提出情報

ジャッジ結果