#include <bits/stdc++.h>
using namespace std;
const int64_t INF = 1ll << 60;
const int MAX_N = 100005, MAX_K = 205;
vector<int64_t> dp, new_dp;
vector<int64_t> pref, pref_sq;
int path[MAX_N][MAX_K];
int64_t get_weight(int l, int r) {
int64_t sum = pref[r] - pref[l];
int64_t sum_sq = pref_sq[r] - pref_sq[l];
return sum * sum - sum_sq;
}
void divide(int ki, int l, int r, int optl, int optr) {
if (l >= r) {
return;
}
int mid = (l + r) / 2;
int opt = optl;
for (int i = optl; i < min(mid, optr); i++) {
int64_t value = dp[i] + get_weight(i, mid);
if (new_dp[mid] > value) {
new_dp[mid] = value;
opt = i;
}
}
path[mid][ki] = opt;
divide(ki, l, mid, optl, opt + 1);
divide(ki, mid + 1, r, opt, optr);
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int &v : A) {
cin >> v;
}
K++;
pref = pref_sq = vector<int64_t>(N + 1);
for (int i = 0; i < N; i++) {
pref[i + 1] = pref[i] + A[i];
pref_sq[i + 1] = pref_sq[i] + A[i] * A[i];
}
memset(path, -1, sizeof path);
dp = vector<int64_t>(N + 1, INF);
dp[0] = 0;
for (int i = 0; i < K; i++) {
new_dp = vector<int64_t>(N + 1, INF);
divide(i + 1, 0, N + 1, 0, N + 1);
dp = new_dp;
}
cout << (get_weight(0, N) - dp[N]) / 2 << "\n";
int pos = N, ki = K;
vector<int> ans;
while (pos > 0) {
ans.push_back(pos = path[pos][ki--]);
}
ans.pop_back();
reverse(ans.begin(), ans.end());
for (int i = 0; i < K - 1; i++) {
cout << ans[i] << " \n"[i + 1 == K - 1];
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
31 ms |
80504 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
30 ms |
80468 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
30 ms |
80496 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
30 ms |
80496 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
31 ms |
80424 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
33 ms |
80488 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
31 ms |
80536 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
31 ms |
80512 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
32 ms |
80432 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
35 ms |
80504 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
30 ms |
80560 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
31 ms |
80520 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
31 ms |
80492 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
31 ms |
80460 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
31 ms |
80524 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
31 ms |
80440 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
32 ms |
80432 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
80460 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
32 ms |
80520 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
32 ms |
80484 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
31 ms |
80468 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
31 ms |
80484 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
35 ms |
80460 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
33 ms |
80448 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
32 ms |
80484 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
31 ms |
80452 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
32 ms |
80436 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
31 ms |
80512 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
31 ms |
80468 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
30 ms |
80588 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
35 ms |
80540 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
32 ms |
80552 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
33 ms |
80452 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
32 ms |
80460 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
31 ms |
80496 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
32 ms |
80512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
32 ms |
80532 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
31 ms |
80580 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
31 ms |
80572 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
40 ms |
80500 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
34 ms |
80552 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
38 ms |
80528 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
38 ms |
80588 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
38 ms |
80544 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
36 ms |
80568 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
34 ms |
80560 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
34 ms |
80504 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
37 ms |
81008 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
33 ms |
80932 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
82 ms |
81020 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
36 ms |
81020 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
90 ms |
80936 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
85 ms |
80980 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
83 ms |
81020 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
69 ms |
80980 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
85 ms |
81008 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
98 ms |
81008 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
60 ms |
85004 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
60 ms |
85000 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
967 ms |
85080 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
58 ms |
85332 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1309 ms |
85064 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
857 ms |
85064 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
868 ms |
85352 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
625 ms |
85260 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
841 ms |
85224 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1029 ms |
85224 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
