思路:
dp[i]=min{dp[j]+(sum[i]-sum[j])^2+M}(dp[i]表示前i个字的花费,0<j<=i-1)
AC代码:
#include<stdio.h>
#define N 500010
int dp[N];
int q[N];
int head,tail;
int sum[N];
int a[N];
int n,m;
int getDP(int i,int j)
{
return dp[j]+(sum[i]-sum[j])*(sum[i]-sum[j])+m;
}
int getUP(int j,int k)
{
return dp[j]+sum[j]*sum[j]-(dp[k]+sum[k]*sum[k]);
}
int getDOWN(int j,int k)
{
return 2*(sum[j]-sum[k]);
}
int main()
{
int i;
while(scanf("%d%d",&n,&m)!=-1)
{
sum[0]=0;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum[i]=sum[i-1]+a[i];
}
head=tail=0;
q[tail++]=0;
dp[0]=0;
for(i=1;i<=n;i++)
{
while(head+1<tail&&getUP(q[head+1],q[head])<=sum[i]*getDOWN(q[head+1],q[head]))
head++;
dp[i]=getDP(i,q[head]);
while(head+1<tail&&getUP(q[tail-1],q[tail-2])*getDOWN(i,q[tail-1])>=getUP(i,q[tail-1])*getDOWN(q[tail-1],q[tail-2]))
tail--;
q[tail++]=i;
}
printf("%d\n",dp[n]);
}
return 0;
}