101차 2번 문제 풀이

Author: hangyeol

live10/test101/문제2/백한결.py

@@ -0,0 +1,20 @@
+def main():
+    N = int(input())
+    cost = [list(map(int, input().split())) for _ in range(N)]
+
+    dp = [[0] * 3 for _ in range(N)]
+
+    dp[0][0] = cost[0][0]
+    dp[0][1] = cost[0][1]
+    dp[0][2] = cost[0][2]
+
+    for i in range(1, N):
+        dp[i][0] = min(dp[i-1][1], dp[i-1][2]) + cost[i][0]
+        dp[i][1] = min(dp[i-1][0], dp[i-1][2]) + cost[i][1]
+        dp[i][2] = min(dp[i-1][0], dp[i-1][1]) + cost[i][2]
+
+    print(min(dp[N-1]))
+
+
+if __name__ == "__main__":
+    main()