#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX=1e5+9;
ll n,K,pos,a[MX],dp[MX],dp1[MX],p[MX];
vector<ll>M,B;
vector<int>ID;
int fdp[202][MX];
bool bad(ll m1,ll b1,ll m2,ll b2,ll m3,ll b3){
return 1.0*(b1-b3)*(m2-m1)<1.0*(b1-b2)*(m3-m1);
}
void add(ll m,ll b,ll idx){
while(M.size()>=2&&bad(M[M.size()-2],B[B.size()-2],M[M.size()-1],B[B.size()-1],m,b))
M.pop_back(),B.pop_back(),ID.pop_back();
M.push_back(m);
B.push_back(b);
ID.push_back(idx);
}
ll query(ll x){
if(pos>(int)M.size()-1)pos=(int)M.size()-1;
while(pos+1<(int)M.size()&&1.0*M[pos+1]*x+B[pos+1]>=1.0*M[pos]*x+B[pos])
pos++;
return M[pos]*x+B[pos];
}
int main(){
cin>>n>>K;
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
p[i]=p[i-1]+a[i];
}
for(int i=1;i<=K;i++){
B.clear();
M.clear();
ID.clear();
pos=0;
add(p[i],-p[i]*p[i]+dp[i],i);
for(int j=i+1;j<=n;j++){
if(j>i+1&&p[j]==p[j-1]){
dp1[j]=dp1[j-1];
fdp[i][j]=fdp[i][j-1];
continue;
}
dp1[j]=query(p[j]);
if(pos>(int)ID.size()-1)pos=ID.size()-1;
fdp[i][j]=ID[pos];
if(p[j]!=p[j-1])add(p[j],-p[j]*p[j]+dp[j],j);
}
for(int k=1;k<=n;k++)dp[k]=dp1[k];
}
printf("%lld\n",dp[n]);
for(int i=K,j=n;i>=1;){
j=fdp[i][j];
i--;
printf("%d ",j);
}
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:28:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld",&a[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 |
424 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
496 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
548 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
548 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
600 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
600 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
600 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
600 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
600 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
600 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
600 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
748 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
748 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1560 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1560 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1560 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1560 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1560 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
1560 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
1560 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
1560 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1560 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1560 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
2208 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2208 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
2336 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
2336 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
2336 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
2348 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
2348 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
2348 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
2348 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
2348 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
59 ms |
10196 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
10196 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
50 ms |
10196 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
45 ms |
10196 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
71 ms |
10196 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
41 ms |
10196 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
55 ms |
10196 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
57 ms |
10196 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
10196 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
25 ms |
10196 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
593 ms |
85776 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
25 ms |
85776 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
660 ms |
86084 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
475 ms |
86084 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
582 ms |
86084 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
419 ms |
86084 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Incorrect |
475 ms |
86084 KB |
contestant didn't find the optimal answer: 124113525649823689 < 124113525649823701 |
| 10 |
Halted |
0 ms |
0 KB |
- |
