Submission #1309715

#TimeUsernameProblemLanguageResultExecution timeMemory
1309715aaaaaaaaFeast (NOI19_feast)C++20
41 / 100
30 ms30604 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = 2001;
int dp[mxN][mxN], a[mxN];
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr); cout.tie(nullptr);
    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= n; ++i){
        cin >> a[i];
        a[i] = a[i - 1] + a[i];
    }
    for(int j = 1; j <= k; ++j){
        int mx = 0;
        for(int i = 1; i <= n; ++i){
            dp[i][j] = max(dp[i - 1][j - 1], dp[i - 1][j]);
            mx = max(mx, dp[i][j - 1] - a[i]);
            dp[i][j] = max(dp[i][j], mx + a[i]);           
        }
    }
    cout << dp[n][k] << "\n";
    return 0;
}   
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...