令
fi,j
表示前
j
个数分割
fi,j=max(fi−1,k+sk×(si−sk)),k<j
然后考虑斜率优化。
j<k 且 j 比
fi−1,j+sj×(si−sj)>fi−1,k+sk×(si−sk)
si×(sj−sk)>s2j−fi−1,j−s2k+fi−1,k
si<s2j−fi−1,j−(s2k−fi−1,k)sj−sk
将 s2j−fi−1,j 作为点 j 的
代码
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 100010
#define ll long long
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void Read(ll& x){
char c=nc();
for(;c<'0'||c>'9';c=nc());
for(x=0;c>='0'&&c<='9';x=(x<<3)+(x<<1)+c-48,c=nc());
}
struct Node{
ll x,y;
Node(ll x=0,ll y=0):x(x),y(y){}
Node operator - (Node a){
return Node(x-a.x,y-a.y);
}
}ch[N],T;
ll f[2][N],s[N];
int i,j,k,n,m,p,t,w[N];
bool b;
inline bool Check(Node a,Node b){
return (double)a.x*b.y>=(double)a.y*b.x;
}
int main(){
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)Read(s[i]),s[i]+=s[i-1];
for(i=1;i<=m;i++,b^=1){
k=t=0;
for(j=1;j<=n;j++){
while(k>t)k--;
while(k<t&&ch[k+1].y-ch[k].y<s[j]*(ch[k+1].x-ch[k].x))k++;
f[b][j]=f[b^1][w[k]]+s[w[k]]*(s[j]-s[w[k]]);
T.x=s[j];T.y=s[j]*s[j]-f[b^1][j];
while(t&&Check(T-ch[t-1],ch[t]-ch[t-1]))t--;
ch[++t]=T;w[t]=j;
}
}
printf("%lld\n",f[b^1][n]);
return 0;
}