斜率优化模板

斜率优化模板hdu3507

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<vector>
using namespace std;
typedef long long ll;
#define mem(name,value) memset(name,value,sizeof(name))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int maxn=500100,inf=0x3f3f3f3f;
ll c[maxn],sum[maxn],dp[maxn];
int q[maxn],n,M,head,tail;

ll getup(int k,int j)
{
    return dp[j]+sum[j]*sum[j]-dp[k]-sum[k]*sum[k];
}

ll getdown(int k,int j)
{
    return sum[j]-sum[k];
}

ll getdp(int i,int j)
{
    return dp[j]+(sum[i]-sum[j])*(sum[i]-sum[j])+M;
}

int main()
{
    while(cin>>n>>M)
    {
        sum[0]=0;
        for(int i=1;i<=n;i++) {
            scanf("%lld",&c[i]);
            sum[i]=sum[i-1]+c[i];
        }

        dp[0]=0;
        head=tail=0;
        q[tail++]=0;
        for(int i=1;i<=n;i++)
        {
            while(head+1<tail && getup(q[head],q[head+1])<=2*sum[i]*getdown(q[head],q[head+1]))
                head++;
            dp[i]=getdp(i,q[head]);
            while(head+1<tail && getup(q[tail-2],q[tail-1])*getdown(q[tail-1],i)>=getup(q[tail-1],i)*getdown(q[tail-2],q[tail-1]))
                tail--;
            q[tail++]=i;
        }

        printf("%lld\n",dp[n]);
    }
}