bzoj1911 特别行动队 斜率优化

斜率优化最裸的裸题，但是式子推了好久，忘了形式。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL long long
using namespace std;
LL dp[1000005];
LL s[1000005];
LL a,b,c;
LL p(LL x)
{   return x*x;}
double get(int j,int k)
{
    double ans=(double)(dp[j]-dp[k])/(double)(s[j]-s[k]);
    ans+=(double)(a*(s[j]+s[k]));
    return ans;
}
int q[1000005];
int H,T;
int main()
{
    int n;
    scanf("%d",&n);
    cin>>a>>b>>c;
    LL x;
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&x);
        s[i]=s[i-1]+x;
    }
    dp[1]=a*p(s[1])+b*s[1]+c;
    H=1;
    q[++T]=0;
    q[++T]=1;
    for(int i=2;i<=n;i++)
    {
        while(H<T&&get(q[H],q[H+1])>(double)(2*a*s[i]+b))H++;
        dp[i]=dp[q[H]]+a*p(s[i]-s[q[H]])+b*(s[i]-s[q[H]])+c;
        while(H<T&&get(q[T-1],q[T])<get(q[T],i))   T--;
        q[++T]=i;
    }
    printf("%lld",dp[n]);
    return 0;
}