动态规划

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 1e4+10;
ll n,p[N],dp[N];
int main()
{
    cin>>n;
    for(int i = 1;i<=n;i++)
        cin>>p[i];
    dp[0] = 0,dp[1] = p[1];
    for(int i = 2;i<=n;i++)
        for(int j = 1;j<=i;j++)
            dp[i] = max(dp[i],dp[i-j]+p[j]);
    cout<<dp[n];
    return 0;
}