#include<bits/stdc++.h>
#include<inttypes.h>
#define MAX_N 100005
#define MAX_K 205
#define pb push_back
#define sq(x) ((x)*(x))
#define abs(x) ((x)>0?(x):(-(x)))
#define LL_inf (1LL<<60)
#define full_inf 0x7fffffff
#define half_inf 0x3fffffff
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pil;
typedef long double LD;
struct node{
LL fi,se,from;
};
LL n,k,l,r,ans,ansi,anss[MAX_K];
LL sum[MAX_N],t[3][MAX_N];
int From[MAX_K][MAX_N];
node line[MAX_N];
bool is_ok(node p1,node p2,node p3){return ((p1.fi-p2.fi)*(p3.se-p1.se))<=((p1.fi-p3.fi)*(p2.se-p1.se));}
int main(){
LL i,j,x,y;
node p;
scanf("%lld %lld",&n,&k);
for(i=1;i<=n;i++){
scanf("%lld",&x);
sum[i]=sum[i-1]+x;
}
for(i=1;i<n;i++) t[1][i]=sum[i]*(sum[n]-sum[i]);
ans=-LL_inf;
if(k==1){
for(i=1;i<n;i++){
if(ans<t[1][i]){
ansi=i;
ans=t[1][i];
}
}
return !printf("%lld\n%lld\n",ans,ansi);
}
for(i=2;i<=k;i++){
l=r=0;
line[r++]={sum[i-1],t[1-(i%2)][i-1],i-1};
for(j=i;j<=n;j++){
x=sum[j]-sum[n];
t[i%2][j]=-LL_inf;
while(r-l>1 && line[l].fi*x+line[l].se<=line[l+1].fi*x+line[l+1].se) l++;
if(r-l){
y=line[l].fi*x+line[l].se+sum[j]*(-x);
if(t[i%2][j]<y){
t[i%2][j]=y;
From[i][j]=line[l].from;
}
}
y=t[1-(i%2)][j-1]+(sum[j]-sum[j-1])*(-x);
if(t[i%2][j]<y){
t[i%2][j]=y;
From[i][j]=j-1;
}
p={sum[j],t[1-(i%2)][j],j};
while(r-l>1 && is_ok(line[r-2],line[r-1],p)) r--;
line[r++]=p;
if(i==k && ans<t[i%2][j]){ans=t[i%2][j];ansi=j;}
}
}
printf("%lld\n",ans);
i=k;
while(i){
anss[i]=ansi;
ansi=From[i][ansi];
i--;
}
for(i=1;i<=k;i++) printf("%lld ",anss[i]);
printf("\n");
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld",&n,&k);
~~~~~^~~~~~~~~~~~~~~~~~~
sequence.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld",&x);
~~~~~^~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
436 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
436 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
692 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
732 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
732 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
732 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
732 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
732 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
732 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
732 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
732 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
732 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
732 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
932 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
932 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
932 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
932 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
932 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
932 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
932 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
932 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
932 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
932 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1704 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1704 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1704 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1704 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1704 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
1704 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
1704 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
1704 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1704 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1704 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
2344 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2344 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
2344 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
2344 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
2344 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
2344 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
2344 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
2344 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2344 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
2344 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
38 ms |
9768 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
9768 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
33 ms |
9768 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
34 ms |
9768 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
37 ms |
9768 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
26 ms |
9768 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
30 ms |
9768 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
45 ms |
9768 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
9768 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
18 ms |
9768 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
312 ms |
83272 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
19 ms |
83272 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
517 ms |
83272 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
308 ms |
83272 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
357 ms |
83272 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
243 ms |
83272 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
280 ms |
83272 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
344 ms |
83272 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
