BOJ)11052 붕어빵 판매하기(다시보기)

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

#include <iostream>
#include <algorithm>
using namespace std;
 
int set_price[1001];
int dp[1001];
 
int main()
{
    int t;
    cin >> t;
    for (int i = 1; i <= t; i++) {
        cin >> set_price[i];
    }
    
    for (int i = 1; i <= t; i++) {
        for (int j = 1; j <= i; j++) {
            dp[i] = max(dp[i], set_price[j] + dp[i - j] );
        }
    }
    cout << dp[t];
}