#include<bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
const ld INF=2e9;
const ll MAXN=1e5+6;
const ll MAXK=210;
ll dp[MAXN][MAXK],a[MAXN];
struct line
{
ld a,b;
ld llersect(line const& other)
{
if(a==other.a)return -INF;
return (ld)(other.b-b)/(a-other.a);
}
ld gety(ld x)
{
return a*x+b;
}
};
struct ConvexHull
{
deque<pair<line,double> >dq;
void add(line l)
{
while(!dq.empty()&&l.llersect(dq.back().first)<=dq.back().second)
{
dq.pop_back();
}
if(dq.empty())dq.push_back({l,-INF});
else dq.push_back({l,l.llersect(dq.back().first)});
}
ld query(ld x)
{
while(dq.size()>1&&dq[1].second<=x)dq.pop_front();
//cout<<dq.front().first.a<<" "<<dq.front().first.b<<endl;
return dq.front().first.gety(x);
}
}ch[MAXK];
ll n,k;
ll pref[MAXN];
int main()
{
cin>>n>>k;
for(ll i=1;i<=n;i++)
{
cin>>a[i];
pref[i]=pref[i-1]+a[i];
}
for(ll i=0;i<=n;i++)
{
for(ll j=0;j<=k+1;j++)dp[i][j]=-INF;
}
for(ll i=1;i<=k+1;i++)ch[i].add({0,-INF});
ch[0].add({0,0});
for(ll i=1;i<=n;i++)
{
for(ll j=1;j<=k+1;j++)
{
dp[i][j]=ch[j-1].query(pref[i]);
//cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
}
for(ll j=1;j<=k+1;j++)
{
ch[j].add({(ld)pref[i],(ld)dp[i][j]-pref[i]*pref[i]});
}
}
cout<<dp[n][k+1]<<endl;
vector<ll>v;
ll l=n;
for(ll i=k;i>=1;i--)
{
for(ll l1=l-1;l1>=0;l1--)
{
if(dp[l1][i]+(pref[l]-pref[l1])*pref[l1]==dp[l][i+1])
{
v.push_back(l1);
l=l1;
break;
}
}
}
for(auto xd:v)cout<<xd<<" ";
cout<<endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
876 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
876 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
876 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
876 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
876 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
876 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
876 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2284 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
2304 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
14 ms |
2540 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2284 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
2412 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
12 ms |
2412 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
18 ms |
2432 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
14 ms |
3052 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
5 ms |
2412 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
2412 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
17900 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
14 ms |
18284 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
143 ms |
20204 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
15 ms |
18156 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
95 ms |
19820 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
105 ms |
18796 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
125 ms |
19808 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
100 ms |
20344 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
109 ms |
19584 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
136 ms |
19820 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
84 ms |
131076 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
