#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
ll cnt,sz,n,k,p[100006],dp[100002][5];
int sv[100002][202],st[100005],v[100006];
vector<int> anw;
double get(ll a,ll b,ll q)
{
a=st[a],b=st[b];
if(p[a]==p[b]) return -1e15;
return (double)(p[b]*p[b]-p[a]*p[a]+dp[a][q%2]-dp[b][q%2])/(double)(p[b]-p[a]);
}
void push(ll x,ll d)
{
st[sz]=x;
while(sz>=2&&get(sz,sz-1,d)<get(sz-1,sz-2,d))
{
sz--,st[sz]=x;
}
sz++;
}
ll val(ll x,ll d)
{
while(cnt<sz-1&&p[x]>=get(cnt,cnt+1,d)) cnt++;
ll nw=st[cnt];
sv[x][d+1]=nw;
return p[x]*p[nw]-p[nw]*p[nw]+dp[nw][d%2];
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>v[i],p[i]=p[i-1]+(ll)v[i];
for(int i=1;i<=k;i++)
{
cnt=0,sz=0;
push(0,0);
for(int j=1;j<=n;j++)
{
dp[j][i%2]=val(j,i-1);
push(j,i-1);
}
}
cout<<dp[n][k%2]<<"\n";
ll g=n;
for(int i=k;i>=1;i--)
{
g=sv[g][i];
anw.push_back(g);
}
reverse(anw.begin(),anw.end());
for(int i=0;i<k;i++)
cout<<anw[i]<<" ";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
708 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1152 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
1144 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
1144 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
1272 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
10 ms |
1144 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
1144 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
1144 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
1144 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
1272 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
1256 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
8824 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
10 ms |
8824 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
84 ms |
8824 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
10 ms |
8824 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
64 ms |
8892 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
70 ms |
8824 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
78 ms |
8912 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
57 ms |
8824 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
67 ms |
8952 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
83 ms |
8952 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
101 ms |
85112 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
100 ms |
85116 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1526 ms |
85496 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
99 ms |
85368 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1817 ms |
85044 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1195 ms |
85112 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1288 ms |
85340 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
737 ms |
85264 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1022 ms |
85240 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1274 ms |
85252 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
