Submission #1025635

#	Time	Username	Problem	Language	Result	Execution time	Memory
1025635		Zicrus	Feast (NOI19_feast)	C++17	59 / 100	174 ms	262144 KiB

feast

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main() {
    ll n, k;
    cin >> n >> k;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    vector<vector<ll>> dp(n, vector<ll>(k+1));
    vector<vector<ll>> dpSeg(n, vector<ll>(k+1));
    for (int j = 1; j <= k; j++) {
        dpSeg[0][j] = max(0ll, a[0]);
    }
    for (int i = 1; i < n; i++) {
        for (int j = 1; j <= k; j++) {
            dp[i][j] = max(dp[i-1][j], dpSeg[i-1][j]);
            dpSeg[i][j] = max(dp[i-1][j-1], dpSeg[i-1][j]) + a[i];
        }
    }

    cout << max(dp.back().back(), dpSeg.back().back());
}

• 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