Submission #1165628

#	Time	Username	Problem	Language	Result	Execution time	Memory
1165628		spycoderyt	Feast (NOI19_feast)	C++20	0 / 100	78 ms	10840 KiB

feast

#include <bits/stdc++.h>
#define int long long
using namespace std;
/*
instead of enforcing K, we find the lambda that produces K, then just do cost + lambda * K

*/
const int N = 3e5+5;
int a[N],dp[2005][2005][2];
int32_t main() {
    int n,k;
    cin >> n >> k;
    for(int i = 0;i<n;i++)cin>>a[i];
    for(int j = 0;j<k;j++) {
        for(int i = j;i<n;i++) {
            dp[i][j][0] = max(dp[i-1][j][0],dp[i-1][j][1]);
            dp[i][j][1] = max(dp[i-1][j-1][0] + a[i], dp[i-1][j][1] + a[i]);
            // cerr << i << " " << j << " " << dp[i][j][0] << " " << dp[i][j][1]<<"\n";
        }
    }
    cout << max(dp[n-1][k-1][0],dp[n-1][k-1][1]);
}

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