#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> pli;
const int mx = 100005;
const ll inf = 2e18;
//struct CHT{
ll A[mx], B[mx];
int I[mx];
int p, sz;
pli query(ll x){
while(p + 1 < sz && (A[p+1] - A[p]) * x <= B[p] - B[p+1]) ++p;
return {A[p] * x + B[p], I[p]};
}
void insert(ll a, ll b, int i){
A[sz] = a;
B[sz] = b;
I[sz] = i;
while(p+1<sz && (B[sz] - B[sz-2]) * (A[sz-1] - A[sz]) >= (A[sz-2] - A[sz])* (B[sz] - B[sz-1])){
A[sz-1] = A[sz];
B[sz-1] = B[sz];
I[sz-1] = I[sz];
--sz;
}
++sz;
}
void clear(){
sz = p = 0;
}
//} C;
int a[mx], S[mx];
int n, k;
ll D[mx][2];
int bck[mx][205];
void input(){
scanf("%d%d",&n,&k);
for(int i = 1; i <= n; i++){
scanf("%d",&S[i]);
S[i] += S[i-1];
}
}
void fucking_cht(){
for(int i = 1; i <= n; i++) D[i][0] = inf;
for(int l = 1, w = 1; l <= k + 1; l++, w ^= 1){
//printf("\n#####lev = %d#####\n",l);
clear();
insert(0,0,0);
for(int i = l-1; i <= n; i++){
if(i >= l){
pli p = query(S[i]);
D[i][w] = p.first + (ll)S[i] * S[i];
bck[i][l] = p.second;
//printf("S[%d] = %d, D[%d][%d] = %lld, bck[%d][%d] = %d\n",i,S[i],i,l,D[i][w],i,l,bck[i][l]);
}
if(D[i][!w] != inf) insert(-2LL * S[i], D[i][!w] + (ll)S[i] * S[i], i);
}
}
printf("%lld\n",((ll)S[n] * S[n] - D[n][(k+1)&1])/2);
stack<int> trace;
for(int i = k+1, now = n; i >= 1; i--){
trace.push(bck[now][i]);
now = bck[now][i];
}
trace.pop();
for(int i=0;i<k;i++){
printf("%d ",trace.top());
trace.pop();
}
}
int main(){
input();
fucking_cht();
}
Compilation message
sequence.cpp: In function 'void input()':
sequence.cpp:41:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&k);
^
sequence.cpp:43:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&S[i]);
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
540 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
540 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
540 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
540 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
540 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
560 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
580 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
584 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
592 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
656 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
664 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
680 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
688 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
688 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
692 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
696 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
700 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
704 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
708 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
712 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
716 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
720 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
856 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
860 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
864 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
868 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
872 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
876 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
880 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
884 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
888 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1536 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1540 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
1672 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
1672 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
1672 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
5 ms |
1672 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
1672 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
1672 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
1672 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
1672 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
9140 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
8 ms |
9160 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
74 ms |
9308 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
10 ms |
9360 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
46 ms |
9360 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
52 ms |
9432 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
57 ms |
9456 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
45 ms |
9496 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
59 ms |
9540 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
77 ms |
9540 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
103 ms |
85020 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
98 ms |
85020 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1127 ms |
85332 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
98 ms |
85332 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1138 ms |
85332 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
829 ms |
85332 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
965 ms |
85332 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
1072 ms |
85444 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1249 ms |
85444 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1364 ms |
85444 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
