Submission #1365390

---

Source Code Expand

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

class Ruiwa():
    def __init__(self, a):
        self.H = h = len(a)
        self.W = w = len(a[0])
        self.R = r = [_[:] for _ in a]
        for i in range(h):
            for j in range(1,w):
                r[i][j] += r[i][j-1]

        for i in range(1,h):
            for j in range(w):
                r[i][j] += r[i-1][j]


def main():
    h,w = LI()
    a = []
    for i in range(h):
        t = LI()
        a.append([t[j] if (i+j)%2 == 0 else -t[j] for j in range(w)])

    r = 0
    for i in range(h):
        rui = Ruiwa(a[i:])
        for j in range(h-i):
            d = collections.defaultdict(list)
            for k in range(w):
                if k > 0:
                    d[rui.R[j][k]].append(k)
                if rui.R[j][k] == 0 and (j+1) * (k+1) > r:
                    r = (j+1) * (k+1)
            for l in d.values():
                if len(l) < 2:
                    continue
                t = l[-1] - l[0] + 1
                if r < t * (j+1):
                    r = t * (j+1)

    return r


print(main())

Submission Info

Judge Result