Algorithms/DP (Dynamic Programming)
RGB 거리 (1149)
Louisus
2020. 5. 19. 00:42
728x90
n = int(input())
rgb = []
for _ in range(n):
rgb.append(list(map(int, input().split())))
for i in range(1, len(rgb)):
rgb[i][0] = min(rgb[i-1][1], rgb[i-1][2]) + rgb[i][0]
rgb[i][1] = min(rgb[i-1][0], rgb[i-1][2]) + rgb[i][1]
rgb[i][2] = min(rgb[i-1][0], rgb[i-1][1]) + rgb[i][2]
print(min(rgb[n-1][0], rgb[n-1][1], rgb[n-1][2]))