#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
ll S[100005];
ll DP1[100005];
ll DP2[100005];
int BES[205][100005];
const ll INF = 1e18;
void fill(int lev, int l, int r, int optl, int optr) {
if (l > r) return;
optr = min(optr,r);
int m = (l+r)/2;
DP2[m] = 1e18;
int bes = -1;
FOR(i,optl,min(optr+1,m)) {
ll tmp = (S[m] - S[i])*(S[m] - S[i])+DP1[i];
if ((S[m] - S[i])*(S[m] - S[i])+DP1[i] <= DP2[m]) {
DP2[m] = (S[m] - S[i])*(S[m] - S[i])+DP1[i];
bes = i;
}
}
BES[lev][m] = bes;
fill(lev, l,m-1,optl,bes);
fill(lev, m+1,r,bes,optr);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
S[0] = 0;
int N, K; cin >> N >> K;
for (int i = 1; i <= N; i++){
ll x; cin >> x;
S[i] = S[i - 1] + x;
}
for (int i = 1; i <= N; i++){
DP2[i] = S[i]*S[i];
}
for (int j = 2; j <= K + 1; j++){
for (int i = 1; i <= N; i++){
DP1[i] = DP2[i];
}
fill(j, 1, N, 1, N);
}
int curpos = N;
vector<int> idx;
for (int j = K + 1; j >= 2; j--){
idx.push_back(BES[j][curpos]);
curpos = BES[j][curpos];
}
reverse(idx.begin(), idx.end());
cout << (S[N] * S[N] - DP2[N])/2 << endl;
for (int j: idx){
cout << j << ' ';
}
cout << endl;
}
Compilation message
sequence.cpp: In function 'void fill(int, int, int, int, int)':
sequence.cpp:24:6: warning: unused variable 'tmp' [-Wunused-variable]
ll tmp = (S[m] - S[i])*(S[m] - S[i])+DP1[i];
^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
436 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
448 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
508 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
524 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
612 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
772 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
772 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
772 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
772 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
772 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
772 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
772 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
772 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
772 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
772 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1660 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1660 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1660 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1660 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1660 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
1660 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
1660 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
1660 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1660 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1660 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
10 ms |
2300 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2300 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
2476 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
2476 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
2476 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
2476 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
2476 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
2476 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
2476 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
2476 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
67 ms |
9596 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
9596 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
58 ms |
9596 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
57 ms |
9596 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
71 ms |
9596 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
49 ms |
9596 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
59 ms |
9596 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
68 ms |
9596 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
9596 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
24 ms |
9596 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
804 ms |
81388 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
32 ms |
81388 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1417 ms |
81832 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
687 ms |
81832 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
882 ms |
81832 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
592 ms |
81832 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
568 ms |
81832 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
724 ms |
81832 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
