11052번: 붕어빵 판매하기

#include<cstdio>

#include<algorithm>

int main()

{

int n, bread[1001], price[1001];

scanf("%d", &n);

for (int i = 1; i <= n; ++i)

scanf("%d", &bread[i]);

std::copy(bread, bread + n + 1, price);

for (int i = 1; i <= n; ++i)

for (int j = 1; i+j <= n; ++j)

if (price[j] + bread[i] > price[i + j])

price[i + j] = price[j] + bread[i];

printf("%d", *(std::max_element(price + 1, price + n + 1)));

}