[BOJ] #2579. 계단오르기 / 실버3 / 70분(실패)

Author: Mingguriguri

minjeong/DynamicProgramming/2024-03-28-[백준]-#2579-계단오르기.py

@@ -0,0 +1,17 @@
+import sys
+input = sys.stdin.readline
+
+n = int(input())
+stair = [0]*301
+for i in range(n):
+    stair[i]=int(input())
+
+DP = [0]*301
+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-3] + stair[i-1] + stair[i], DP[i-2]+stair[i])
+
+print(DP[n-1])