#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
#define SZ(x) (int)(x).size()
int n;int K;
int ps[100005];
int dp[100005][2];
signed frm[100005][205];
deque<signed>dq;
int f(int x,int id,int k){
return ps[id]*x+dp[id][k]-ps[id]*ps[id];
}
bool chk(int id1,int id2,int id3,int k){
__int128 a1;__int128 a2;__int128 a3;__int128 b1;__int128 b2;__int128 b3;
a1=ps[id1];a2=ps[id2];a3=ps[id3];
b1=dp[id1][k]-ps[id1]*ps[id1];
b2=dp[id2][k]-ps[id2]*ps[id2];
b3=dp[id3][k]-ps[id3]*ps[id3];
if(a2==a3){return 1;}
//return (b2-b1)/(a1-a2)>=(b3-b1)/(a1-a3);
return (b2-b1)*(a1-a3)>=(b3-b1)*(a1-a2);
}
signed main(){
cin>>n>>K;
K+=1;
for(int i=1;i<=n;i++){
cin>>ps[i];
ps[i]+=ps[i-1];
}
dp[1][1]=0;
for(int j=2;j<=K;j++){
while(dq.size()){dq.pop_back();}
dq.push_back(0);
int tmp=j;
j=1;
for(int i=1;i<=n;i++){
while(dq.size()>=2&&f(ps[i],dq.front(),j-1)<=f(ps[i],dq[1],j-1)){dq.pop_front();}
dp[i][j]=f(ps[i],dq.front(),j-1);
frm[i][tmp]=dq.front();
while(dq.size()>=2&&chk(dq[0],dq[1],i,j-1)){dq.pop_back();}
if(dq.size()==1&&ps[i]==ps[dq.front()]){dq.pop_front();}
dq.push_back(i);
/*
for(int j=K;j>=2;j--){
while(dq[j-1].size()>=2&&f(ps[i],dq[j-1].front(),j-1)<=f(ps[i],dq[j-1][1],j-1)){dq[j-1].pop_front();}
dp[i][j]=f(ps[i],dq[j-1].front(),j-1);
frm[i][j]=dq[j-1].front();
while(dq[j].size()>=2&&chk(dq[j][0],dq[j][1],i,j)){dq[j].pop_back();}
if(dq[j].size()==1&&ps[i]==ps[dq[j].front()]){dq[j].pop_front();}
dq[j].push_back(i);
}
int j=1;
while(dq[j].size()>=2&&chk(dq[j][0],dq[j][1],i,j)){dq[j].pop_back();}
if(dq[j].size()==1&&ps[i]==ps[dq[j].front()]){dq[j].pop_front();}
dq[j].push_back(i);
*/
}
for(int i=0;i<=n;i++){
swap(dp[i][0],dp[i][1]);
dp[i][1]=0;
}
j=tmp;
}
/*
for(int i=1;i<=n;i++){
for(int j=1;j<=K;j++){
cout<<dp[i][j]<<" ";
}cout<<"\n";
}*/
cout<<dp[n][0]<<"\n";
int nw=n;
int k=K;
vector<int>vc;
for(int i=1;i<=K-1;i++){
nw=frm[nw][k];
vc.push_back(nw);
k--;
}
reverse(vc.begin(),vc.end());
for(int i=0;i<vc.size();i++){
cout<<vc[i]<<" ";
}
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:96:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
96 | for(int i=0;i<vc.size();i++){
| ~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
2392 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
2652 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
2652 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
2656 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
4728 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
4696 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
5 ms |
4700 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
4700 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
5 ms |
4700 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
4720 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
4700 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
4700 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
10844 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
10840 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
46 ms |
10844 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
10844 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
35 ms |
10844 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
38 ms |
10844 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
41 ms |
10844 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
27 ms |
10844 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
31 ms |
10844 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
39 ms |
10688 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
36 ms |
83156 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
27 ms |
83288 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
418 ms |
83548 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
33 ms |
83540 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
592 ms |
83464 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
379 ms |
83416 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
404 ms |
83796 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
300 ms |
83588 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
326 ms |
83564 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
388 ms |
83568 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
