BZOJ1911 Apio2010 特别行动队

---

Description

Sample Input & Output

4
-1 10 -20
2 2 3 4

9

---

这里要注意的是a<0，所以如果写成$g(x,y)$的形式要小心。
方程：

$$dp[i]=\min_{k=0}^{i-1}\{dp[k]+w[k+1,i]\}$$ $$w[x,y]=\{Len=\sum_{k=x}^{y}X_k\mid a*Len^2+b*Len+c\}$$ $$g(x,y)=\frac{dp[y]-dp[x]+a(sum[y]^2-sum[x]^2)+b(sum[x]-sum[y])}{2a*(sum[y]-sum[x])}$$

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define M 1000005
using namespace std;
int n,a,b,c;
long long sum[M],dp[M];
long long sqr(long long x){return x*x;}
long long calc(long long x){return a*sqr(x)+b*x+c;}
long long up(int x,int y){return dp[y]-dp[x]+a*sqr(sum[y])-a*sqr(sum[x])+b*(sum[x]-sum[y]);}
long long down(int x,int y){return 2*a*(sum[y]-sum[x]);}
int deq[M],L=0,R=-1;
int main(){
    scanf("%d %d %d %d",&n,&a,&b,&c);
    for(int i=1,x;i<=n;i++){
        scanf("%d",&x);
        sum[i]=sum[i-1]+x;
    }
    deq[++R]=0;
    for(int i=1;i<=n;i++){
        while(L<R&&up(deq[L],deq[L+1])>=sum[i]*down(deq[L],deq[L+1]))++L;
        dp[i]=dp[deq[L]]+calc(sum[i]-sum[deq[L]]);
        while(L<R&&up(deq[R-1],deq[R])*down(deq[R],i)>=up(deq[R],i)*down(deq[R-1],deq[R]))--R;
        deq[++R]=i;
    }
    cout<<dp[n]<<endl;
}