Submission #1228898

#	Time	Username	Problem	Language	Result	Execution time	Memory
1228898		unnick	Feast (NOI19_feast)	C++20	59 / 100	1095 ms	2824 KiB

feast

#include <iostream>
#include <vector>

typedef long long int ll;

using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    vector<ll> b(k*2+1);

    for (int i = 0; i < n; i++) {
        ll a;
        cin >> a;
        for (int j = k*2-1; j >= 1; j -= 2) {
            b[j+1] = max(b[j], b[j+1]);
            b[j] = max(b[j], b[j-1]) + a;
        }
    }

    ll r = 0;
    for (ll v: b) r = max(v,r);

    cout << r << "\n";
}

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