Submission #21974702

---

Source Code Expand

H,W = map(int,input().split())
MAP = []
for i in range(H):
    MAP.append(list(input()))
U = [[0] * W for i in range(H)]
D = [[0] * W for i in range(H)]
L = [[0] * W for i in range(H)]
R = [[0] * W for i in range(H)]

for i in reversed(range(H)):
    for j in range(W):
        if MAP[i][j]=='.' and i<H-1:
            U[i][j] = U[i+1][j]+1
        elif MAP[i][j]=='.':
            U[i][j] = 1

for i in range(H):
    for j in range(W):
        if MAP[i][j]=='.' and i>0:
            D[i][j] = D[i-1][j]+1
        elif MAP[i][j]=='.':
            D[i][j] = 1

for i in range(H):
    for j in reversed(range(W)):
        if MAP[i][j]=='.' and j<W-1:
            L[i][j] = L[i][j+1]+1
        elif MAP[i][j]=='.':
            L[i][j] = 1

for i in range(H):
    for j in range(W):
        if MAP[i][j]=='.' and j>0:
            R[i][j] = R[i][j-1]+1
        elif MAP[i][j]=='.':
            R[i][j] = 1

ans = 0

for i in range(H):
    for j in range(W):
        ans = max(ans,U[i][j]+D[i][j]+L[i][j]+R[i][j]-3)

print(ans)

Submission Info

Judge Result