bzoj 1911 特别行动队 APIO2010

dp[i]=a*(sum[i]-sum[j])+b*(sum[i]-sum[j])+c..

x->sum[j] y->dp[j]+a*sum[j]*sum[j]

维护上凸壳即可//记得开long long

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
//by zfy =.=
typedef long long LL;
const int N=1100000;
int l,r,n,q[N];
LL a,b,c,A[N],sum[N],dp[N];
LL sqr(LL x){return x*x;}
LL Y(int x){return dp[x]+a*sqr(sum[x]);}
LL X(int x){return sum[x];}
inline LL read()
{
    LL x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return f*x;
}
bool judge2(int i,int j,int k){
	return (double)(Y(i)-Y(j))/(X(i)-X(j))>=(double)(Y(j)-Y(k))/(X(j)-X(k));
}
LL Get_Dp(int i,int t){
	return dp[t]+a*sqr(sum[i]-sum[t])+b*(sum[i]-sum[t])+c;
}
int main(){
	n=read();
	a=read();b=read();c=read();
	for(int i=1;i<=n;sum[i]=sum[i-1]+A[i],i++) A[i]=read();
	l=r=1;
	for(int i=1;i<=n;i++){
		while(l<r&&Get_Dp(i,q[l+1])>=Get_Dp(i,q[l])) l++; 
		dp[i]=Get_Dp(i,q[l]);
		while(l<r&&judge2(i,q[r],q[r-1])) r--;
		q[++r]=i;
	} 
	printf("%lld",dp[n]);
	return 0;
}