# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
488141 | ntabc05101 | Split the sequence (APIO14_sequence) | C++14 | 26 ms | 11664 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;
#define taskname ""
const long long inf = 1e17;
int main() {
if (fopen(taskname".inp", "r")) {
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
else {
if (fopen(taskname".in", "r")) {
freopen(taskname".in", "r", stdin);
freopen(taskname".out", "w", stdout);
}
}
cin.tie(0)->sync_with_stdio(0);
int n, K; cin >> n >> K;
long long a[n + 1];
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i]; a[i] += a[i - 1];
}
vector<long long> dp[n + 1];
function<long double(int, int, int)> slope = [&](int k, int i, int j) {
return (long double)(dp[i][k] - a[i] * a[i] - dp[j][k] + a[j] * a[j]) / (a[j] - a[i]);
};
K++;
int prf[n + 1][K + 1];
memset(prf, 0, sizeof(prf));
long long res = 0;
for (int i = 0; i <= n; i++) {
dp[i].assign(K + 1, -inf);
}
dp[0][0] = 0;
deque<int> deq[K + 1];
for (int i = 0; i <= K; i++) {
deq[i].clear();
}
deq[0].push_back(0);
for (int i = 1; i <= n; i++) {
for (int k = 1; k <= K; k++) {
while (deq[k - 1].size() > 1 && slope(k - 1, deq[k - 1][0], deq[k - 1][1]) < a[i]) {
deq[k - 1].pop_front();
}
if (deq[k - 1].empty()) {
continue;
}
int j = deq[k - 1].front();
dp[i][k] = dp[j][k - 1] + (a[i] - a[j]) * a[j];
prf[i][k] = j;
}
for (int k = 1; k <= K; k++) {
while (deq[k].size() > 1 && slope(k, deq[k][deq[k].size() - 2], deq[k].back()) > slope(k, deq[k].back(), i)) {
deq[k].pop_back();
}
deq[k].push_back(i);
}
}
cout << dp[n][K] << "\n";
while (K > 1) {
cout << prf[n][K] << " ";
n = prf[n][K--];
}
cout << "\n";
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
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... |