[BOJ] 계단 오르기 / 실버 3 / 50분

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

Author: YoonYn9915

YoonYn9915/dp/2024-10-21-[백준]-#2579-계단 오르기.py

@@ -0,0 +1,18 @@
+N = int(input())
+
+dp = [0] * (N+1)
+point = [0] * (N+1)
+for i in range(1, N+1):
+    point[i] = int(input())
+if N==1:
+    print(point[1])
+    exit()
+elif N==2:
+    print(sum(point[:3]))
+    exit()
+dp[1] = point[1]
+dp[2] = point[1]+point[2]
+for i in range(3, N+1):
+    dp[i] = max(dp[i-2]+point[i], dp[i-3]+point[i-1]+point[i])
+
+print(dp[-1])