[BZOJ1096][ZJOI2007]仓库建设

原题地址

斜率优化…

全部变量开ll以为不会爆，结果就一个关键地方没开ll，WA了一波，真是没救了…

#include <queue>
#include <cstdio>
using namespace std;
typedef long long ll;
const ll N=1000010;
ll n;
ll x[N],p[N],c[N],s[N],t[N],f[N];

struct Vec{
    ll x,y;

    Vec() {}

    Vec(ll x,ll y):x(x),y(y) {}

    friend Vec operator-(Vec a,Vec b){
        return Vec(a.x-b.x,a.y-b.y);
    }

    friend ll operator*(Vec a,Vec b){
        return a.x*b.y-a.y*b.x;
    }
};
deque<Vec> Q;

int main(){
    scanf("%lld",&n);
    for(ll i=1;i<=n;i++) scanf("%lld%lld%lld",&x[i],&p[i],&c[i]);
    for(ll i=1;i<=n;i++) s[i]=s[i-1]+p[i];
    for(ll i=1;i<=n;i++) t[i]=t[i-1]+s[i-1]*(x[i]-x[i-1]);
    f[1]=c[1];
    for(ll i=2;i<=n;i++){
        ll  X=-s[i-1],Y=f[i-1]-t[i-1]+s[i-1]*x[i-1];
        Vec tmp=Vec(X,Y);
        while(Q.size()>1){
            Vec a,b;
            a=Q.front();Q.pop_front();b=Q.front();
            if((tmp-a)*(a-b)>0){
                Q.push_front(a);
                break;
            }
        }
        Q.push_front(tmp);
        f[i]=x[i]*Q.back().x+Q.back().y;
        while(Q.size()>1){
            Vec a,b;
            a=Q.back();Q.pop_back();b=Q.back();
            if(x[i]*b.x+b.y>f[i]){
                Q.push_back(a);
                break;
            }
            f[i]=x[i]*b.x+b.y;
        }
        if(f[i]>0) f[i]=0;
        f[i]+=t[i]+c[i];
    }
    printf("%lld\n",f[n]);

    return 0;
}