[BOJ] RGB거리 / 실버 1 / 40분

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

Author: YoonYn9915

YoonYn9915/dp/2025-05-03-[백준]-#1149-RGB거리.py

@@ -0,0 +1,16 @@
+n = int(input())
+
+cost = []
+minCost = -int(1e9)
+dp = [[0]*3 for _ in range(n)]
+for i in range(n):
+    cost.append(list(map(int, input().split())))
+
+dp[0][0], dp[0][1], dp[0][2] = cost[0][0], cost[0][1], cost[0][2]
+
+for i in range(1, n):
+    dp[i][0] = min(dp[i-1][1] + cost[i][0], dp[i-1][2] + cost[i][0])
+    dp[i][1] = min(dp[i-1][0] + cost[i][1], dp[i-1][2] + cost[i][1])
+    dp[i][2] = min(dp[i-1][0] + cost[i][2], dp[i-1][1] + cost[i][2])
+
+print(min(dp[n-1][0], dp[n-1][1], dp[n-1][2]))