Submission #1017397

#	Time	Username	Problem	Language	Result	Execution time	Memory
1017397		vjudge1	Feast (NOI19_feast)	C++17	0 / 100	1085 ms	262144 KiB

feast

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

using namespace std;

int main() {
    //not uy tins
    int N, K;
    cin >> N >> K;

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

    vector<vector<int>> dp(K + 1, vector<int>(N + 1, 0));
    vector<int> prefixSum(N + 1, 0);

    for (int i = 1; i <= N; ++i) {
        prefixSum[i] = prefixSum[i - 1] + A[i - 1];
    }

    for (int k = 1; k <= K; ++k) {
        for (int n = 1; n <= N; ++n) {
            dp[k][n] = dp[k][n - 1];
            for (int i = 0; i < n; ++i) {
                dp[k][n] = max(dp[k][n], dp[k - 1][i] + prefixSum[n] - prefixSum[i]);
            }
        }
    }

    cout << dp[K][N] << endl;

    return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 11
• Subtask 6: 0 / 20
• Subtask 7: 0 / 29