#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pl;
struct line{
pl l;
int idx;
line(){}
line(pl temp,int i){l = temp;idx = i;}
};
const int MAXN = 101010;
const int MAXK = 220;
int N,K;
ll DT[2][MAXN];
int from[MAXK][MAXN];
int arr[MAXN];
ll sum[MAXN];
ll calc(line l,ll p){
return l.l.first * p + l.l.second;
}
double cross(line a,line b){
return (double)(b.l.second - a.l.second) / (a.l.first - b.l.first);
}
int main(){
scanf("%d %d",&N,&K);
for(int i=1;i<=N;i++){
scanf("%d",arr+i);
sum[i] = sum[i-1] + arr[i];
}
for(int j=1;j<=K+1;j++){
int now = 0;
int p = (j+1) & 1;
int n = j & 1;
vector<line> hull;
pl temp = pl(sum[j-1] , DT[p][j-1] - sum[j-1] * sum[N]);
hull.push_back(line(temp,j-1));
for(int i=j;i<=N;i++){
while(now < hull.size() - 1 && cross(hull[now],hull[now+1]) <= sum[i]) now++;
DT[n][i] = calc(hull[now],sum[i]) + sum[N] * sum[i] - sum[i] * sum[i];
from[j][i] = hull[now].idx;
// printf("%d %d %d %d %d\n",j,i,from[j][i],now,hull.size());
pl temp = pl(sum[i] , DT[p][i] - sum[i] * sum[N]);
line ttemp = line(temp,i);
if(!hull.empty() && hull.back().l.first == temp.first && temp.second <= hull.back().l.second) continue;
if(!hull.empty() && hull.back().l.first == temp.first) hull.pop_back();
while(hull.size() > 1 && cross(hull.back() ,ttemp ) <= cross(hull[hull.size() - 2] , hull.back())) {
hull.pop_back();
}
hull.push_back(line(temp,i));
if(now >= hull.size()) now = hull.size() - 1;
}
}
printf("%lld\n",DT[(K+1) & 1][N]);
int now = N;
int h = K+1;
now = from[h][now];
h--;
vector<int> ans;
while(h!=0){
ans.push_back(now);
assert(1<= now && now <= N-1);
now = from[h][now];
h--;
}
while(!ans.empty()){
printf("%d ",ans.back());
ans.pop_back();
}
printf("\n");
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:51:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(now < hull.size() - 1 && cross(hull[now],hull[now+1]) <= sum[i]) now++;
~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:63:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(now >= hull.size()) now = hull.size() - 1;
~~~~^~~~~~~~~~~~~~
sequence.cpp:38: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:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",arr+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 |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
348 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
420 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
292 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
500 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1400 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1144 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1272 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1528 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
676 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
2040 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
2040 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
1916 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
2040 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
2040 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
760 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
1144 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
1144 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
1176 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
123 ms |
10032 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
1416 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
64 ms |
6292 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
68 ms |
7064 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
104 ms |
7800 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
79 ms |
6716 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
89 ms |
7396 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
113 ms |
9164 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
37 ms |
9684 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
36 ms |
9592 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1293 ms |
88568 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
38 ms |
10352 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1383 ms |
87508 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
498 ms |
62188 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1081 ms |
68692 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
822 ms |
57252 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
889 ms |
64484 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1143 ms |
80268 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
