Submission #1229207

#	Time	Username	Problem	Language	Result	Execution time	Memory
1229207		trimkus	Feast (NOI19_feast)	C++20	71 / 100	293 ms	327680 KiB

feast

#include <bits/stdc++.h>

using namespace std;
using ll = long long;


int main() {
    int N, K;
    cin >> N >> K;
    vector<ll> a(N);
    ll tot = 0;
    int neg = 0;
    for (int i = 0; i < N; ++i) {
        cin >> a[i];
        if (a[i] < 0) neg += 1;
        if (a[i] >= 0) tot += a[i];
    }
    if (neg <= 1 || K == 1) {
        if (K > 1) {
            cout << tot << "\n";
            return 0;
        }
        ll res = 0, sum = 0;
        for (int i = 0; i < N; ++i) {
            sum = max(sum + a[i], a[i]);
            res = max(res, sum);
        }
        cout << res << "\n";
        return 0;
    }
    vector<vector<vector<ll>>> dp(N, vector<vector<ll>>(K + 1, vector<ll>(2)));
    dp[0][1][1] = a[0];
    ll res = 0;
    for (int i = 1; i < N; ++i) {
        for (int j = 1; j <= K; ++j) {
            dp[i][j][1] = max(dp[i - 1][j][1] + a[i], dp[i - 1][j - 1][0] + a[i]);
            dp[i][j][0] = max(dp[i - 1][j][1], dp[i - 1][j][0]);
        }
    }
    cout << max(dp[N - 1][K][0], dp[N - 1][K][1]) << "\n";
}

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