#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,k,v[100005],s[100005];
int from[100005][205];
struct date
{
ll a,b,l,r,poz;
};
deque<date> coada[205];
ll dp[205];
ll f(date F, ll x)
{
return F.a*x+F.b;
}
void out(ll i,ll val)
{
while(!coada[i].empty()&&coada[i].front().r<val)
coada[i].pop_front();
}
void add(ll i,date line)
{
while(!coada[i].empty())
{
date prv=coada[i].back();
if(prv.a==line.a)
{
if(line.b>=prv.b)
break;
coada[i].pop_back();
continue;
}
ll x=(line.b-prv.b)/(prv.a-line.a);
while(f(line,x)>=f(prv,x))
x++;
if(x<=prv.l)
{
coada[i].pop_back();
continue;
}
coada[i].pop_back();
prv.r=x-1;
line.l=x;
line.r=1e18;
coada[i].push_back(prv);
coada[i].push_back(line);
break;
}
if(coada[i].empty())
{
line.l=0;
line.r=1e18;
coada[i].push_back(line);
return;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n>>k;
k++;
for(int i=1;i<=n;i++)
{
cin>>v[i];
s[i]=s[i-1]+v[i];
}
ll ans=0;
for(int i=1;i<=n;i++)
{
dp[1]=s[i]*s[i];
date q;
q.a=-2*s[i];
q.b=s[i]*s[i]+dp[1];
q.poz=i;
add(1,q);
for(int j=2;j<=min(k,i*1LL);j++)
{
out(j-1,s[i]);
date x=coada[j-1].front();
from[i][j]=x.poz;
ll val=x.a*s[i]+x.b;
dp[j]=s[i]*s[i]+val;
q.a=-2*s[i];
q.b=s[i]*s[i]+dp[j];
q.poz=i;
add(j,q);
}
if(i==n)
ans=dp[k];
}
ans=s[n]*s[n]-ans;
ans/=2;
cout<<ans<<'\n';
ll i=n;
ll j=k;
vector<ll> sol;
while(i>0)
{
ll x=from[i][j];
if(x>0)
sol.push_back(x);
i=x;
j--;
}
reverse(sol.begin(),sol.end());
for(int i:sol)
cout<<i<<' ';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1364 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
1492 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1364 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
1492 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
1364 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
1492 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
7 ms |
2004 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
1364 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1364 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
9300 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
9556 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
75 ms |
11056 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
9448 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
48 ms |
10768 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
53 ms |
9956 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
67 ms |
10920 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
55 ms |
11340 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
54 ms |
10680 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
69 ms |
10812 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
56 ms |
88908 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
53 ms |
89344 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
872 ms |
106988 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
56 ms |
90828 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
831 ms |
103680 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
569 ms |
96072 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
745 ms |
104800 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
604 ms |
103468 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
598 ms |
103044 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
760 ms |
104084 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
