Submission #1019262

#	Time	Username	Problem	Language	Result	Execution time	Memory
1019262		Nicolaikrob	Feast (NOI19_feast)	C++17	21 / 100	1061 ms	262144 KiB

feast

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

int main() {
    int n, k; cin >> n >> k;
    ll A[n+1], DP[n+2][k+2]; A[0] = 0;
    for(int i = 1; i <= n; i++) cin >> A[i];
    for(int i = 0; i < n+2; i++) DP[i][0] = 0;
    for(int i = 0; i < k+2; i++) DP[0][i] = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= k; j++) {
            DP[i][j] = DP[i-1][j];
            ll ns = A[i];
            for(int l = i-1; l >= 0; l--) {
                DP[i][j] = max(DP[i][j], DP[l][j-1]+ns);
                ns += A[l];
            }
        }
    }
    cout << DP[n][k];
}

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