[python/파이썬] 백준 14430 자원 캐기

[문제 출처]

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

14430번: 자원 캐기

 

[문제 풀이]

 

import sys
input = sys.stdin.readline

x,y = map(int, input().split())

arr = [[0 for i in range(y+1)] for _ in range(x+1)]
#print(arr)
dp = [[0 for i in range(y+1)] for _ in range(x+1)]
for i in range(1,x+1):
    tmp = list(map(int, input().split()))
    tmp.insert(0,0)
    arr[i] = tmp

for i in range(1,x+1):
    for j in range(1,y+1):
        dp[i][j] = max(arr[i][j] + dp[i][j-1], arr[i][j] + dp[i-1][j])

print(dp[x][y])