# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
970013 | blackslex | Feast (NOI19_feast) | C++17 | 115 ms | 262144 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int n, k;
int main() {
scanf("%d %d", &n, &k);
vector<ll> a(n + 5), pref(n + 5);
vector<vector<ll>> dp(n + 5, vector<ll>(k + 5));
vector<ll> dp2(k + 5);
for (int i = 1; i <= n; i++) scanf("%lld", &a[i]), pref[i] = pref[i - 1] + a[i];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) dp[i][j] = max(dp[i - 1][j], dp2[j - 1] + pref[i]);
for (int j = 0; j <= k; j++) dp2[j] = max(dp2[j], dp[i][j] - pref[i]);
}
printf("%lld", dp[n][k]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |