bzoj 2726 [SDOI2012]任务安排 CDQ分治维护凸包 dp

因为前面的对于后面的有影响，所以需要倒着dp。
$f[i]=min(f[j]+sf[i](S+sum[i]-sum[j]))$
其中sf为F的后缀和，sum为T的后缀和。
然后化成
$f[j]=sf[i]*sum[j]+(f[i]-sf[i]*s-sf[i]*sum[i]$
此时你高兴的看到了一个斜率优化的式子，sf单调，sum单调，那直接维护凸包就行了呀！
不过出题人告诉你时间可以是负的。。。
然后就变成了CDQ维护凸包。

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define N 310000
int n,h1,r1;
ll S;
ll f[N],sf[N],sum[N];
int a[N],q[N],b[N],tmp[N];
struct poi
{
    ll x,y;
    poi(){}
    poi(ll x,ll y):x(x),y(y){}
    friend poi operator - (const poi &r1,const poi &r2)
    {return poi(r1.x-r2.x,r1.y-r2.y);}
    friend ld operator ^ (const poi &r1,const poi &r2)
    {return (ld)r1.x*r2.y-(ld)r2.x*r1.y;}
    ld sp(){return (ld)y/(ld)x;}
}st[N];
int cmp1(int x,int y){return sf[x]<sf[y];}
int cmp2(int x,int y){return sum[x]<sum[y];}
void merge(int *a,int l,int r,int mid)
{
    int p1=l,p2=mid+1;
    for(int i=l;i<=r;i++)
    {
        if(a[i]<=mid)tmp[p1++]=a[i];
        else tmp[p2++]=a[i];
    }
    for(int i=l;i<=r;i++)a[i]=tmp[i];
}
void back(int *a,int l,int r,int mid,int tp)
{
    int p1=l,p2=mid+1,pos=l;
    while(p1<=mid&&p2<=r)
    {
        if(!tp ? cmp1(a[p1],a[p2]):cmp2(a[p1],a[p2]))
            tmp[pos++]=a[p1++];
        else tmp[pos++]=a[p2++];
    }
    while(p1<=mid)tmp[pos++]=a[p1++];
    while(p2<=r)tmp[pos++]=a[p2++];
    for(int i=l;i<=r;i++)a[i]=tmp[i];
}
void solve(int l,int r)
{
    if(l==r)return;
    int mid=(l+r)>>1;
    merge(a,l,r,mid);
    merge(b,l,r,mid);
    solve(mid+1,r);
    h1=1;r1=0;
    for(int i=mid+1;i<=r;i++)
    {
        poi t(sum[b[i]],f[b[i]]);
        while(r1>1&&((st[r1]-st[r1-1])^(t-st[r1]))<=0)
            r1--;
        st[++r1]=t;q[r1]=b[i];
    }
    for(int i=l;i<=mid;i++)
    {
        while(h1<r1&&(st[h1+1]-st[h1]).sp()<sf[a[i]])
            h1++;
        f[a[i]]=min(f[a[i]],f[q[h1]]+sf[a[i]]*(S+sum[a[i]]-sum[q[h1]]));
    }
    solve(l,mid);
    back(a,l,r,mid,0);
    back(b,l,r,mid,1);
}
int main()
{
    //freopen("tt.in","r",stdin);
    scanf("%d%lld",&n,&S);
    for(int i=1;i<=n;i++)
        scanf("%lld%lld",&sum[i],&sf[i]);
    for(int i=n;i>=1;i--)
        sum[i]+=sum[i+1],sf[i]+=sf[i+1];
    for(int i=1;i<=n+1;i++)a[i]=i,b[i]=i;
    memset(f,0x3f,sizeof(f));f[n+1]=0;
    sort(a+1,a+1+n,cmp1);
    sort(b+1,b+1+n,cmp2);
    solve(1,n+1);
    printf("%lld\n",f[1]);
    return 0;
}