[boj] 11052 solved

haremeat · Dec 6, 2021 · 02e355f · 02e355f
1 parent 64cf333
commit 02e355f
Showing 1 changed file with 4 additions and 6 deletions.
diff --git a/boj/11052.py b/boj/11052.py
@@ -2,17 +2,15 @@
 
 import sys
 n = int(sys.stdin.readline())
-cards = list(map(int, sys.stdin.readline().split()))
+cards = [0] + list(map(int, sys.stdin.readline().split()))
 dp = [0] * (n + 1)
 
 
-dp[1] = cards[0]
-dp[2] = max(cards[0] + cards[1], cards[0])
+dp[1] = cards[1]
 
-for i in range(3, n + 1):
+for i in range(2, n + 1):
     for j in range(1, i + 1):
-        dp[i] = max(dp[i], dp[i - j] + cards[i])
-
+        dp[i] = max(dp[i], dp[i-j] + cards[j])
 
 print(dp[n])