#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const int nmax=100005;
struct dreapta
{
long long a,b;
int wh;
}st[nmax];
long long dp[2][nmax];
int prc[205][nmax];
long long mx;
long long a[nmax],sum[nmax];
long double a1,a2,b1,b2;
int ans[nmax];
int p;
long double intersect(dreapta unu,dreapta doi)
{
a1=unu.a;b1=unu.b;a2=doi.a;b2=doi.b;
return (b1-b2)/(a2-a1);
}
int u,i,j,cnt,ult,n,k,use,poz_opt;
void ins(long long A,long long B,int prc)
{
dreapta x={A,B,prc};
if(p<=u&&st[u].a==A&&st[u].b>=B)
return;
while(p<=u&&st[u].a==A&&st[u].b<=B)
u--;
while(p<u&&intersect(st[u],st[u-1])>intersect(st[u-1],x))
u--;
st[++u]=x;
}
long long get_opt(long long x)
{
long double pct=x;
while(p<u&&intersect(st[p],st[p+1])<pct)
p++;
ult=st[p].wh;
return (1LL*st[p].a*x+1LL*st[p].b);
}
void solve(bool rev)
{
bool updatat=0;
for(i=1;i<=n;i++)
sum[i]=sum[i-1]+a[i];
for(cnt=1;cnt<=k;cnt++)
{
u=0;p=1;use=1-use;
for(i=cnt;i<n;i++)
{
ins(sum[i-1],dp[1-use][i-1],i-1);
dp[use][i]=1LL*get_opt(sum[i]-sum[n])+1LL*sum[i]*sum[n]-1LL*sum[i]*sum[i];
prc[cnt][i]=ult;
if(cnt==k&&dp[use][i]>mx)
mx=1LL*dp[use][i],poz_opt=i;
}
}
for(int i=1;i<=k;i++)
{
ans[k-i+1]=poz_opt;
poz_opt=prc[k-i+1][poz_opt];
}
}
int main()
{
//freopen("data.in","r",stdin);
ios_base::sync_with_stdio(false);
mx=-1;
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>a[i];
solve(0);
cout<<mx<<'\n';
for(i=1;i<=k;i++)
cout<<ans[i]<<' ';
return 0;
}
Compilation message
sequence.cpp: In function 'void solve(bool)':
sequence.cpp:45:10: warning: unused variable 'updatat' [-Wunused-variable]
bool updatat=0;
^~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
4 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
4 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
1792 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
2048 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
1024 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
1024 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
106 ms |
9564 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
64 ms |
6136 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
66 ms |
7032 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
84 ms |
7504 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
72 ms |
6392 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
65 ms |
7032 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
83 ms |
8736 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
31 ms |
6552 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
26 ms |
6520 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1022 ms |
84348 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
41 ms |
7032 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1188 ms |
83844 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
730 ms |
60596 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
845 ms |
64972 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
629 ms |
54032 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
604 ms |
60792 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
822 ms |
76380 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
