[백준] 14500번_테트로미노

문제 링크 : https://www.acmicpc.net/problem/14500

14500번: 테트로미노

tetro = (((0,1),(0,2),(0,3)),
        ((1,0),(2,0),(3,0)),
        ((0,1),(1,0),(1,1)),
        ((1,0),(2,0),(2,1)),
        ((0,1),(0,2),(-1,2)),
        ((0,1),(1,1),(2,1)),
        ((1,0),(0,1),(0,2)),
        ((0,1),(-1,1),(-2,1)),
        ((1,0),(1,1),(1,2)),
        ((0,1),(1,0),(2,0)),
        ((0,1),(0,2),(1,2)),
        ((1,0),(1,1),(2,1)),
        ((0,1),(-1,1),(-1,2)),
        ((1,0),(0,1),(-1,1)),
        ((0,1),(1,1),(1,2)),
        ((0,-1),(0,1),(1,0)),
        ((-1,0),(0,1),(1,0)),
        ((0,-1),(-1,0),(1,0)),
        ((-1,0),(0,-1),(0,1)))

n,m = map(int,input().split())
paper = [list(map(int,input().split())) for _ in range(n)]

max_sum = 0
for i in range(n):
    for j in range(m):
        for t in tetro:
            try:
                sum_ = paper[i][j]
                for k in range(3):
                    sum_ += paper[i+t[k][0]][j+t[k][1]]
                max_sum = max(max_sum,sum_)
            except IndexError:
                continue
print(max_sum)