#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5 + 10, MAXK = 210;
const ll INF = LLONG_MAX / 3;
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define fillchar(a, s) memset((a), (s), sizeof(a))
inline ll sqr (ll x) {
return x * x;
}
int N, K;
ll P[MAXN];
ll dp[2][MAXN]; //minimum of sum of squares.
int opt[MAXK][MAXN];
int ci;
ll *cdp, *pdp;
void rec (int lt, int rt, int olt, int ort) {
if (lt > rt) {
return;
}
int mid = (lt + rt) / 2;
int oi = -1;
for (int i = olt; i <= ort && i < mid; i++) {
ll val = sqr(P[mid] - P[i]) + pdp[i];
if (cdp[mid] > val) {
cdp[mid] = val;
oi = i;
}
}
opt[ci][mid] = oi;
assert(oi != -1);
rec(lt, mid - 1, olt, oi);
rec(mid + 1, rt, oi, ort);
}
int main() {
scanf("%d %d", &N, &K);
K++;
for (int i = 1; i <= N; i++) {
scanf("%lld", &P[i]);
P[i] += P[i - 1];
}
for (int i = 0; i < 2; i++) {
for (int j = 0; j <= N; j++) {
dp[i][j] = INF;
}
}
cdp = dp[0];
pdp = dp[1];
cdp[0] = 0;
for (int i = 1; i <= K; i++) {
swap(cdp, pdp);
for (int j = 0; j <= N; j++) {
cdp[j] = INF;
}
ci = i;
rec(i, N, i - 1, N - 1);
}
printf("%lld\n", (sqr(P[N]) - cdp[N]) / 2);
int oi = N;
for (int i = K; i > 1; i--) {
oi = opt[i][oi];
printf("%d ", oi);
}
puts("");
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &N, &K);
~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", &P[i]);
~~~~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
3 ms |
492 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
588 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
588 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
676 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
676 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
676 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
684 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
688 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
3 ms |
692 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
3 ms |
788 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
788 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
788 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
3 ms |
788 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
3 ms |
788 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
788 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
3 ms |
788 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
788 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
788 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
1040 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
3 ms |
1040 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
3 ms |
1040 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
3 ms |
1040 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
1040 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
3 ms |
1040 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
3 ms |
1040 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
1040 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1040 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
1040 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
5 ms |
1736 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
3 ms |
1736 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
1736 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
4 ms |
1748 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1752 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
4 ms |
1752 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
4 ms |
1752 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
4 ms |
1752 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1752 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1752 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
2540 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
4 ms |
2540 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
13 ms |
2608 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
13 ms |
2608 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
13 ms |
2708 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
2716 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
2716 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
2716 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
2716 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
2716 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
62 ms |
9932 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
9932 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
78 ms |
9932 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
74 ms |
9932 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
81 ms |
9932 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
63 ms |
9932 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
71 ms |
9932 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
89 ms |
9932 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
35 ms |
9932 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
34 ms |
9932 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
708 ms |
83116 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
28 ms |
83116 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1637 ms |
83784 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
949 ms |
83784 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
950 ms |
83784 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
635 ms |
83784 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
764 ms |
83784 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
959 ms |
83784 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
