# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1113043 | adaawf | Split the sequence (APIO14_sequence) | C++17 | 95 ms | 131072 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 <iostream>
#include <assert.h>
using namespace std;
long long int a[100005], c[100005], f[100005][205], g[100005][205];
void trya(int i, int l, int r, int tl, int tr) {
if (tl > tr) return;
long long int mid = (tl + tr) / 2, res = -1, h;
for (int j = l; j <= r; j++) {
if (j > mid) break;
long long int k = (c[mid] - c[j - 1]) * c[j - 1] + f[j - 1][i - 1];
if (res < k) {
res = k;
h = j;
}
}
g[mid][i] = h; f[mid][i] = res;
trya(i, l, h, tl, mid - 1);
trya(i, h, r, mid + 1, tr);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
c[i] = c[i - 1] + a[i];
}
for (int i = 2; i <= k + 1; i++) {
for (int j = 1; j <= n; j++) {
f[j][i] = -1e18;
}
trya(i, 2, n, i, n);
}
cout << f[n][k + 1] << '\n';
int h = n, l = k + 1;
while (l != 1) {
cout << g[h][l] - 1 << " ";
h = g[h][l] - 1;
l--;
}
}
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... |