Submission #1075350

#	Time	Username	Problem	Language	Result	Execution time	Memory
1075350		South_Cloud	Feast (NOI19_feast)	C++17	41 / 100	14 ms	60500 KiB

feast

#include<bits/stdc++.h>

using namespace std;

const int N = 2007;

int n, K, a[N];

long long f[N][N][2], ans = 0;

int main() {
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cin >> n >> K;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j <= K; j++) {
            f[i][j][0] = max(f[i - 1][j][0], f[i - 1][j][1]);
            if(j > 0) f[i][j][1] = max(f[i - 1][j - 1][0], f[i - 1][j][1]) + a[i];
        }
    }
    for(int i = 0; i <= K; i++) ans = max(ans, max(f[n][i][0], f[n][i][1]));
    cout << ans;
    return 0;
}

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