#include<stdio.h>
int n,k;
long long sum[100001];
long long hsum[100001];
long long square[100001];
int backtrack[100001][201];
long long stk[100001][2];
long long dp[100001][2];
int stp;
long long inf;
long long calc(int i,int j,int turn){
long long a = sum[i],c = sum[j],b = dp[i][turn]-hsum[i],d = dp[j][turn]-hsum[j];
//printf("%lld %lld\n",a,c);
if(a==c){
if(b<d) return inf;
else return 0;
}
if(b<d){
return (b-d)/(c-a);
}else{
return (b-d+c-a-1)/(c-a);
}
}
int main(){
int now,target;
long long ans,ansn;
long long res;
scanf("%d %d",&n,&k);
inf = (1 << 31);
inf*=inf;
inf+=inf;
inf--;
for(int i=1;i<=n;i++){
scanf("%lld",&sum[i]);
sum[i]+=sum[i-1];
}
for(int i=1;i<=n;i++){
hsum[i]=sum[i]*sum[n];
square[i]=sum[i]*sum[i];
}
for(int i=1;i<=n;i++){
dp[i][1]=hsum[i]-square[i];
}
for(int j=2;j<=k;j++){
stp=1;now=0;
stk[0][0]=j-1;
stk[0][1]=0;
for(int i=j;i<=n;i++){
while(now<stp-1){
if(stk[now+1][1]<=sum[i]){
now++;
}else{
break;
}
}
target=(int)stk[now][0];
//printf("%d\n",target);
dp[i][j%2]=sum[target];
dp[i][j%2]*=sum[i];
dp[i][j%2]+=dp[target][1-(j%2)];
dp[i][j%2]-=hsum[target];
dp[i][j%2]+=hsum[i];
dp[i][j%2]-=square[i];
backtrack[i][j]=target;
/*
printf("Now Stack:\n");
for(int ist=0;ist<stp;ist++){
printf("%lld %lld\n",stk[ist][0],stk[ist][1]);
}
printf("%d %d %lld %d\n",i,j,dp[i][j%2],target);
*/
while(stp>0){
res=calc(stk[stp-1][0],i,1-(j%2));
if(res<=stk[stp-1][1]){
stp--;
if(now==stp) now--;
}else{
break;
}
}
if(stp==0) res=0;
stk[stp][0]=i;
stk[stp][1]=res;
stp++;
}
}
ans=0;
for(int i=1;i<=n;i++){
if(dp[i][k%2]>ans){
ans=dp[i][k%2];
ansn=i;
}
}
printf("%lld\n",ans);
for(int stp=k;stp>=1;stp--){
printf("%lld ",ansn);
ansn=backtrack[ansn][stp];
}
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:30:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&k);
^
sequence.cpp:36:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld",&sum[i]);
^
sequence.cpp:99:33: warning: 'ansn' may be used uninitialized in this function [-Wmaybe-uninitialized]
ansn=backtrack[ansn][stp];
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
0 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
0 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
0 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
0 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
0 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
0 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
0 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
0 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
0 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
0 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
0 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
0 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
1 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
1 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
1 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
1 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
1 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
1 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
1 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
8 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
8 ms |
8 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
73 ms |
9 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
8 ms |
9 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
49 ms |
9 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
61 ms |
9 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
58 ms |
9 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
46 ms |
9 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
51 ms |
9 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
64 ms |
9 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
80 ms |
83 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
82 ms |
83 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Execution timed out |
2088 ms |
84 KB |
Time limit exceeded |
| 4 |
Correct |
83 ms |
84 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1546 ms |
84 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Execution timed out |
2039 ms |
84 KB |
Time limit exceeded |
| 7 |
Correct |
1111 ms |
85 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
1397 ms |
85 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Execution timed out |
2017 ms |
86 KB |
Time limit exceeded |
| 10 |
Correct |
867 ms |
86 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
