[파이썬/백준 1932번] 정수 삼각형

https://www.acmicpc.net/problem/1932

정수삼각형..

최댓값을 저장하면서 내려오기

 

N=int(input())
tlist=[list(map(int,input().split())) for _ in range(N)]
k=2
for i in range(1,N):
    for j in range(k):
        if j==0:
            tlist[i][j]=tlist[i][j]+tlist[i-1][j]
        elif i==j:
            tlist[i][j]=tlist[i][j]+tlist[i-1][j-1]
        else:
            tlist[i][j]=max(tlist[i-1][j-1],tlist[i-1][j])+tlist[i][j]
    k+=1

print(max(tlist[N-1]))