[BOJ] #2579.계단 오르기 / 실버3 / 60(X)

Author: learntosurf

learntosurf/Dynamic Programming/2024-11-27-[BOJ]-#2579-계단오르기.py

@@ -0,0 +1,24 @@
+import sys 
+input = sys.stdin.readline
+
+N = int(input())
+stair = [int(input()) for _ in range(N)]
+
+# N에 따른 예외 처리
+if N == 1:
+    print(stair[0])
+    exit()
+
+if N == 2:
+    print(stair[0] + stair[1])
+    exit()
+
+dp = [0] * (N+1)
+dp[0] = stair[0]
+dp[1] = stair[0] + stair[1]
+dp[2] = max(stair[0] + stair[2], stair[1] + stair[2])
+
+for i in range(3, N):
+    dp[i] = max(dp[i-2] + stair[i], dp[i-3] + stair[i-1] + stair[i])
+
+print(dp[N-1])