[BZOJ1096]ZJOI2007仓库建设|斜率优化DP

看起来就是要分成若干段嘛，然后求出前缀和YY一些状态转移方程，上斜率优化。。

我的笔记

#include<iostream>
#include<cstdio>
#include<memory.h>
#include<cstdlib>
#define ll long long
#define q1 que[head]
#define q2 que[head+1]
#define t1 que[tail]
#define t2 que[tail-1]
#define maxn 1000005
using namespace std;
int i,j,n,head,tail,c[maxn],x[maxn],p[maxn],que[maxn];
ll sump[maxn],sum2[maxn],dp[maxn];
ll G(int i) {return dp[i]+sum2[i];}
ll H(int i) {return (ll)x[i]*sump[i]-sum2[i]+(ll)c[i];}
ll get(int i)
{
    while (tail>head&&x[i]*(sump[q2]-sump[q1])>G(q2)-G(q1)) head++;
    return -x[i]*sump[q1]+G(q1)+H(i);
}
void ins(int i)
{
    while (tail>head&&(G(i)-G(t1))*(sump[t1]-sump[t2])<(G(t1)-G(t2))*(sump[i]-sump[t1])) tail--;
    que[++tail]=i;
}
int main()
{
    scanf("%d",&n);
    sump[0]=sum2[0]=dp[0]=0;
    for (i=1;i<=n;i++)
    {
        scanf("%d%d%d",&x[i],&p[i],&c[i]);
        sump[i]=sump[i-1]+(ll)p[i];
        sum2[i]=sum2[i-1]+(ll)x[i]*(ll)p[i];
    }
    head=tail=1;que[1]=0;
    dp[1]=get(1);ins(1);
    for (i=2;i<=n;i++)
    {
        dp[i]=get(i);
        ins(i);
    }
    cout<<dp[n];
}