백준 1932 - 정수 삼각형 (파이썬)

Answer

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

for i in range(1, n):
    for j in range(i + 1):
        if j == 0:
            dp[i][0] += dp[i - 1][0]
        elif j == i:
            dp[i][i] += dp[i - 1][i - 1]
        else:
            dp[i][j] += max(dp[i - 1][j - 1], dp[i - 1][j])
    
print(max(dp[n - 1]))