题解

背包问题

#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 1005;
int n;
int a[N];
int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        for (int j = 1; j < i; j++)
            a[i] = max(a[i], a[j] + a[i - j]);
    }
    printf("%d\n", a[n]);
    return 0;
}