【题解】洛谷P3628[APIO2010]特别行动队 斜率优化

第一道AC的紫题，纪念一下

#include<cstdio>
typedef long long ll;
const int N=1e6+10;
ll sum[N],dp[N],q[N];
int a,b,c,n;
ll gety(int j,int k)
{
	return (dp[j]+a*sum[j]*sum[j]-dp[k]-a*sum[k]*sum[k]);
}
ll getx(int i,int j)
{
	return (sum[i]-sum[j]);
}
ll getk(int i)
{
	return (2*a*sum[i]+b);
}
int main()
{
	//freopen("in.txt","r",stdin);
	scanf("%d%d%d%d",&n,&a,&b,&c);
	int i,x,head=0,tail=0;
	q[tail++]=0;
	for(i=1;i<=n;i++)
	{
		scanf("%d",&x);
		sum[i]=sum[i-1]+x;
		while(head+1<tail&&gety(q[head+1],q[head])>=getx(q[head+1],q[head])*getk(i))head++;
		dp[i]=dp[q[head]]+a*(sum[i]-sum[q[head]])*(sum[i]-sum[q[head]])+b*(sum[i]-sum[q[head]])+c;
		while(head+1<tail&&gety(i,q[tail-1])*getx(q[tail-1],q[tail-2])>=gety(q[tail-1],q[tail-2])*getx(i,q[tail-1]))tail--;
	    q[tail++]=i;
	}
	printf("%lld\n",dp[n]);
	return 0;
}