Submission #1000298

#	Time	Username	Problem	Language	Result	Execution time	Memory
1000298		nngan267	Feast (NOI19_feast)	C++17	41 / 100	11 ms	27300 KiB

feast

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

#define ll long long
#define db long double
#define ii pair<int, int>
#define fi first
#define se second

const int maxn = 2005;
const ll mod = 111539786;
const db eps = -1e9;
const ll inf = 1e18;


int n, k;
int a[maxn];
ll dp[maxn][maxn];
ll s[maxn];

void solve(){
    cin >> n >> k;
    for(int i=1; i<=n; i++){
        cin >> a[i];
        s[i] = s[i-1] + a[i];
    }
    for(int i=1; i<=k; i++){
        ll max_val = 0;
        for(int j=1; j<=n; j++){
            dp[i][j] = dp[i][j-1];
            dp[i][j] = max(dp[i][j], max_val + s[j]);
            max_val = max(max_val, dp[i-1][j] - s[j]);
        }
    }
    cout << dp[k][n] << "\n";
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int test = 1;
    while(test--){
        solve();
    }
}

• 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