[백준]11052

문제

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

풀이

점화식 : d[n] = d[n], d[n-i]+p[i]

import sys

n = int(sys.stdin.readline().rstrip())
p = [0] + list(map(int,sys.stdin.readline().rstrip().split()))
d = [0] * (n+1)

for i in range(1, n+1):
    for j in range(1, i+1):
        d[i] = max(d[i], d[i-j]+p[j])

print(d[n])