붕어빵 판매하기 / https://www.acmicpc.net/problem/11052

baekjoon11052.py

n = int(input())
p, d = [0] * (n+1), [0] * (n+1)
p = list(map(int, input().split()))
p.insert(0, 0)

for i in range(1, n+1):
    for j in range(1, i+1):
        if d[i] < d[i-j] + p[j]:
            d[i] = d[i-j] + p[j]
print(d[n])
-----------------
n = int(input())
p, d = [0] * (n+1), [0] * (n+1)
p = list(map(int, input().split()))
p.insert(0, 0)

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])