#include<cstdio>
#include<algorithm>
#include<deque>
using namespace std;
typedef unsigned long long ll;
typedef pair<ll,ll> pp;
ll d[2][100010],s[100010],N,K;
short r[201][100001];
void f(int x,int y){
if(x==1)return;
f(x-1,r[x][y]);
printf("%d ",(int)r[x][y]);
}
struct convex{
deque<ll> a,b,c;
void init(){a.clear();b.clear();c.clear();}
void push(ll n,ll m,ll v){
while(a.size()>1&&(b[b.size()-2]-b.back())*(n-a.back())>=(b.back()-m)*(a.back()-a[a.size()-2])){
a.pop_back();
b.pop_back();
c.pop_back();
}
a.push_back(n);
b.push_back(m);
c.push_back(v);
}
pp query(ll x){
while(a.size()>1&&(a[1]-a[0])*x>=(b[0]-b[1])){
a.pop_front();
b.pop_front();
c.pop_front();
}
return pp(a[0]*x+b[0],c[0]);
}
};
int main(){
scanf("%lld%lld",&N,&K);
if(K==0)K++;
for(int i=1;i<=N;i++){
scanf("%lld",&s[i]);
s[i]+=s[i-1];
}
convex* pre=new convex;
convex* cur=new convex;
pp ret;
for(int i=1;i<=N;i++){
d[1][i]=s[i]*(s[N]-s[i]);
pre->push(s[i],d[1][i]-s[i]*s[N],i);
}
for(int g=2;g<=K+1;g++){
for(int i=g;i<=N;i++){
ret=pre->query(s[i]);
d[g%2][i]=ret.first+(s[N]-s[i])*s[i];
r[g][i]=ret.second;
cur->push(s[i],d[g%2][i]-s[i]*s[N],i);
}
pre->init();
swap(cur,pre);
}
printf("%lld\n",d[(K+1)&1][N]);
f(K+1,N);
delete cur,pre;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
43184 KB |
Output is correct - contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
43184 KB |
Output is correct - contestant found the optimal answer: 999 == 999 |
| 3 |
Incorrect |
0 ms |
43184 KB |
Output isn't correct - Integer 2 violates the range [1, 1] |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Halted |
0 ms |
0 KB |
- |
