Submission #9664138

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;

#define LL long long

const int N=1e5+50;
int n,L[N],R[N];
LL ans,tl,tr,lq,rq;
priority_queue < LL,vector<LL>,less<LL> > Left; 
priority_queue < LL,vector<LL>,greater<LL> > Right;

template<typename elemType>
inline void Read(elemType &T){
    elemType X=0,w=0; char ch=0;
    while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}
    while(isdigit(ch)) X=(X<<3)+(X<<1)+(ch^48),ch=getchar();
    T=(w?-X:X);
}

int main() {
    Read(n);
    for(register int i=1;i<=n;++i){
        Read(L[i]);Read(R[i]);
        L[i]=R[i]-L[i];
    }
    Left.push(R[1]);
    Right.push(R[1]);
    
    for(register int i=2;i<=n;++i){
        tl-=L[i-1];
        tr+=L[i];
        lq=Left.top()+tl;
        rq=Right.top()+tr;
        if(lq<=R[i] && R[i]<=rq){
            Left.push(R[i]-tl);
            Right.push(R[i]-tr);
        }
        else if(R[i]>=lq){
            ans+=R[i]-rq;
            Right.pop();
            Left.push(rq-tl);
            Right.push(R[i]-tr);
            Right.push(R[i]-tr);
        }
        else{
            ans+=lq-R[i];
            Left.pop();
            Right.push(lq-tr);
            Left.push(R[i]-tl);
            Left.push(R[i]-tl);
        }
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result