#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct line{
ll slope, constant;
int num;
line() : slope(0), constant(0), num(0) {}
line(ll a, ll b, int c) : slope(a), constant(b), num(c) {}
};
struct CHT{
int sz;
deque<line> L;
CHT() : sz(0) {}
double get_point(line L1, line L2){
return (double)(L2.constant-L1.constant)/(L1.slope-L2.slope);
}
bool increase(line L1, line L2, line L3){
double p1=get_point(L1,L2);
double p2=get_point(L2,L3);
return p1<=p2;
}
void update(line L3){
while(sz>1){
line L2=L.back();
L.pop_back();
sz--;
line L1=L.back();
if(increase(L1,L2,L3)){
L.push_back(L2);
sz++;
break;
}
}
L.push_back(L3);
sz++;
}
ll query(ll x){
while(sz>1 && get_point(L[0],L[1])<(double)x){
L.pop_front();
sz--;
}
line L1=L.front();
return L1.slope*x+L1.constant;
}
int get_line_num(){
line L1=L.front();
return L1.num;
}
void clr(){
while(!L.empty()) L.pop_back();
sz=0;
}
};
int n, k;
ll sum[100005];
ll dp[100005];
int path[205][100005];
CHT cht[2];
int main()
{
scanf("%d %d",&n,&k);
for(int i=1 ; i<=n ; i++){
scanf("%lld",&sum[i]);
sum[i]+=sum[i-1];
}
k++;
cht[0].update(line(0,0,0));
for(int i=1 ; i<=k ; i++){
int prev=(i-1)%2;
int cur=i%2;
cht[cur].clr();
for(int j=i ; j<=n ; j++){
ll val=cht[prev].query(sum[j]);
dp[j]=val+sum[n]*sum[j]-sum[j]*sum[j];
path[i][j]=cht[prev].get_line_num();
cht[cur].update(line(sum[j],dp[j]-sum[n]*sum[j],j));
}
}
printf("%lld\n",dp[n]);
int res[205];
int cnt=k;
res[k]=n;
while(cnt!=1){
res[cnt-1]=path[cnt][res[cnt]];
cnt--;
}
for(int i=1 ; i<k ; i++) printf("%d ",res[i]);
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
66 | scanf("%d %d",&n,&k);
| ~~~~~^~~~~~~~~~~~~~~
sequence.cpp:68:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
68 | scanf("%lld",&sum[i]);
| ~~~~~^~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
2 ms |
1024 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
9 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
10 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
9 ms |
1792 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
11 ms |
2176 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
9 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
5 ms |
1024 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
1024 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
86 ms |
9592 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
4 ms |
1024 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
63 ms |
6132 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
70 ms |
6904 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
80 ms |
7416 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
57 ms |
6264 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
66 ms |
7032 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
84 ms |
8700 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
31 ms |
6392 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
31 ms |
6656 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
813 ms |
84560 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
31 ms |
7504 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1053 ms |
83944 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
700 ms |
59684 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
784 ms |
65004 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
599 ms |
54148 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
654 ms |
60780 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
823 ms |
76508 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |