[백준] 1149번 RGB거리 (파이썬)

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

n = int(input())
arr = []
for _ in range(n):
    arr.append(list(map(int, input().split())))
    
dp = [[0]*3 for _ in range(n)]

for i in range(n):
    dp[i][0] = min(dp[i-1][1], dp[i-1][2]) + arr[i][0]
    dp[i][1] = min(dp[i-1][0], dp[i-1][2]) + arr[i][1]
    dp[i][2] = min(dp[i-1][0], dp[i-1][1]) + arr[i][2]

print(min(dp[n-1]))