bzoj1588:[hnoi2002]营业额统计双向链表/splay/treap

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define ls i<<1
#define rs ls | 1
#define mid ((ll+rr)>>1)
typedef long long LL;
const LL INF = (1LL<<60)-1;
const double Pi = acos(-1.0);
const int N = 1e5+10, M = 1e6+11, mod = 1e9+7, inf = (1<<30)-1;

struct ss {int x,id;
    bool operator < (const ss &r) const
    {
        return x<r.x;
    }
}a[N];
int ans,n,Rank[N],lef[N],righ[N];
int main() {
        scanf("%d",&n);
        for(int i = 1; i <= n; ++i) scanf("%d",&a[i].x),a[i].id=i;
        ans = a[1].x;
        sort(a+1,a+n+1);
        for(int i = 1; i <= n; ++i) Rank[a[i].id] = i;
        for(int i = 1; i <= n; ++i) lef[i] = i-1, righ[i] = i+1;
        righ[n] = 0;
        for(int i = n; i >=1; --i) {
                int x = Rank[i];
                if(lef[x] && righ[x]) {
                    ans += min(a[x].x - a[lef[x]].x,a[righ[x]].x - a[x].x);
                    righ[lef[x]] = righ[x];
                    lef[righ[x]] = lef[x];
                } else if(!lef[x] && righ[x]) {
                    ans += a[righ[x]].x - a[x].x;
                    lef[righ[x]] = 0;
                } else if(!righ[x] && lef[x]){
                    ans += a[x].x - a[lef[x]].x;
                    righ[lef[x]] = 0;
                }
        }
        printf("%d\n",ans);
}

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define ls i<<1
#define rs ls | 1
#define mid ((ll+rr)>>1)
typedef long long LL;
const LL INF = (1LL<<60)-1;
const double Pi = acos(-1.0);
const int N = 1e5+10, M = 1e6+11, mod = 1e9+7, inf = (1<<30)-1;

struct data {int l,r,v,size,rnd,w;}tr[N * 20];
int n,size=0,root,ans,Ans;
void update(int k) {tr[k].size=tr[tr[k].l].size+tr[tr[k].r].size+tr[k].w;}
void rturn (int &k){
        int t=tr[k].l;tr[k].l=tr[t].r;tr[t].r=k;
        tr[t].size=tr[k].size;update(k);k=t;
}
void lturn(int &k) {
        int t=tr[k].r;tr[k].r=tr[t].l;tr[t].l=k;
        tr[t].size=tr[k].size;update(k);k=t;
}
void insert(int &k,int x) {
        if(k == 0) {
            size++;k=size;
            tr[k].size=tr[k].w=1;
            tr[k].v=x;
            tr[k].rnd=rand();
            return ;
        }
        tr[k].size++;
        if(tr[k].v == x) tr[k].w++;
        else if(x > tr[k].v) {
            insert(tr[k].r,x);
            if(tr[tr[k].r].rnd<tr[k].rnd) lturn(k);
        } else {
            insert(tr[k].l,x);
            if(tr[tr[k].l].rnd<tr[k].rnd) rturn(k);
        }
}
void query_pre(int k,int x) {
        if(k == 0) return ;
        if(tr[k].v <= x) {
            ans=tr[k].v;query_pre(tr[k].r,x);
        } else query_pre(tr[k].l,x);
}
void query_nex(int k,int x) {
        if(k == 0) return ;
        if(tr[k].v >= x) {
            ans=tr[k].v;;query_nex(tr[k].l,x);
        } else query_nex(tr[k].r,x);
}

int main() {
        root = 0;
        scanf("%d",&n);
        for(int i = 1; i <= n; ++i) {
            int x;
            scanf("%d",&x);
            if(i == 1) {
                Ans = x;
            } else {
                ans = -inf;query_pre(root,x);
                int fi = ans;
                ans = inf;query_nex(root,x);
                int se = ans;
                //cout<<fi<<" "<<se<<endl;
               if(fi!=-inf || se != inf) Ans += min(x-fi,se-x);
            }
            insert(root,x);
        }
        printf("%d\n",Ans);
        return 0;
}

#include<iostream>
#include<cstdio>
#define inf 1000000000
using namespace std;
int ans,n,t1,t2,rt,size;
int tr[50001][2],fa[50001],num[50001];
void rotate(int x,int &k)
{
    int y=fa[x],z=fa[y],l,r;
    if(tr[y][0]==x)l=0;else l=1;r=l^1;
    if(y==k)k=x;
    else{if(tr[z][0]==y)tr[z][0]=x;else tr[z][1]=x;}
    fa[x]=z;fa[y]=x;fa[tr[x][r]]=y;
    tr[y][l]=tr[x][r];tr[x][r]=y;
 }
void splay(int x,int &k)
{
    int y,z;
    while(x!=k)
    {
        y=fa[x],z=fa[y];
        if(y!=k)
        {
            if((tr[y][0]==x)^(tr[z][0]==y))rotate(x,k);
            else rotate(y,k);
        }
        rotate(x,k);
    }
}
void ins(int &k,int x,int last)
{
     if(k==0){size++;k=size;num[k]=x;fa[k]=last;splay(k,rt);return;}
     if(x<num[k])ins(tr[k][0],x,k);
     else ins(tr[k][1],x,k);
 }
void ask_before(int k,int x)
{
     if(k==0)return;
     if(num[k]<=x){t1=num[k];ask_before(tr[k][1],x);}
     else ask_before(tr[k][0],x);
 }
void ask_after(int k,int x)
{
   if(k==0)return;
   if(num[k]>=x){t2=num[k];ask_after(tr[k][0],x);}
   else ask_after(tr[k][1],x);
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        int x;if(scanf("%d",&x)==EOF)x=0;
        t1=-inf;t2=inf;
        ask_before(rt,x);
        ask_after(rt,x);
        if(i!=1)ans+=min(x-t1,t2-x);
        else ans+=x;
        ins(rt,x,0);
    }
    printf("%d",ans);
    return 0;
}