#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[300005];
pair <int, int> dp[300005];
void calc(int n, int pen) {
pair <int, int> mx = {0, 0};
for (int i = 1; i <= n; i++) {
dp[i] = max(dp[i - 1], {mx.first + a[i] - pen, mx.second - 1});
mx = max(mx, {dp[i].first - a[i], dp[i].second});
}
}
signed main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
int l = 1, r = 1e15;
while (l < r) {
int mid = (l + r) / 2;
if (-dp[n].second <= k) {
r = mid;
} else {
l = mid + 1;
}
}
calc(n, l);
cout << dp[n].first + l * k;
}
# | 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... |