Print Article HDU 3507 斜率优化

题目大意

给你一列数，要你把这列数分成若干段，每一段的权值为sigma(c[i])^2+m，求最小的总权值。

分析

用到了斜率优化，资料传送门

code

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>

using namespace std;

long long sum[700000];
long long d[700000];
int a[700000];
int head,tail;
int n,m;

long long getup(int x,int y)
{
    return d[x]+sum[x]*sum[x]-(d[y]+sum[y]*sum[y]);
}

long long getdown(int x,int y)
{
    return 2*(sum[x]-sum[y]);
}

int main()
{
    while (~scanf("%d%d",&n,&m))
    {
        memset(sum,0,sizeof(sum));
        for (int i=1;i<=n;i++)
        {
            long long x;
            scanf("%lld",&x);
            sum[i]=sum[i-1]+x;
        }
        head=1; tail=1;
        memset(d,0,sizeof(d));
        memset(a,0,sizeof(a));
        for (int i=1;i<=n;i++)
        {
            while ((head+1<=tail) && (getup(a[head+1],a[head])<=getdown(a[head+1],a[head])*sum[i]))
                head++;
            int x=a[head];
            d[i]=d[x]+(sum[i]-sum[x])*(sum[i]-sum[x])+m;
            while ((head+1<=tail) && (getup(i,a[tail])*getdown(a[tail],a[tail-1])<=getup(a[tail],a[tail-1])*getdown(i,a[tail])))
                tail--;
            tail++;
            a[tail]=i;
        }
        printf("%lld\n",d[n]);
    }
}