贪吃的猴子

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int max_bananas(vector<int>& numbers, int N) {
    int n = numbers.size();
    if (N >= n) {
        return accumulate(numbers.begin(), numbers.end(), 0);
    }

    // 初始化 dp 数组
    vector<vector<int>> dp(N + 1, vector<int>(n, 0));

    // 计算前缀和
    vector<int> prefix_sum(n + 1, 0);
    for (int i = 1; i <= n; ++i) {
        prefix_sum[i] = prefix_sum[i - 1] + numbers[i - 1];
    }

    // 动态规划
    for (int k = 1; k <= N; ++k) {
        for (int i = 0; i + k <= n; ++i) {
            int j = i + k - 1;
            dp[k][i] = max(dp[k - 1][i + 1] + numbers[i], dp[k - 1][i] + numbers[j]);
        }
    }

    // 返回结果
    return dp[N][0];
}

int main() {
    int n;
    cin >> n;
    vector<int> numbers(n);
    for (int i = 0; i < n; ++i) {
        cin >> numbers[i];
    }
    int N;
    cin >> N;

    cout << max_bananas(numbers, N) << endl;

    return 0;
}