알고리즘/백준
[백준]
무룡룡
2021. 12. 20. 23:49
1.
n = int(input())
dp = [0 for i in range(n+1)]
arr = [0] + list(map(int,input().split()))
for i in range(1,n+1):
for j in range(1,i+1):
dp[i] = max(dp[i], dp[i-j] + arr[j])
#print(dp)
print(dp[i])
2.