bzoj 1208 宠物收养所--splay

这个题也是单点维护，不管来的是人还是狗，只要num=0就插入，否则就删除。

// File Name: ACM/bzoj/1208.cpp
// Author: Zlbing
// Created Time: 2013年08月08日 星期四 16时33分53秒

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#include<set>
#include<map>
#include<vector>
#include<cstring>
#include<stack>
#include<cmath>
#include<queue>
using namespace std;
#define CL(x,v); memset(x,v,sizeof(x));
#define INF 0x3f3f3f3f
#define LL long long
#define REP(i,r,n) for(int i=r;i<=n;i++)
#define RREP(i,n,r) for(int i=n;i>=r;i--)
const int MAXN=8e4+;
const int mod=;
struct SplayTree {
    int sz[MAXN];
    int ch[MAXN][];
    int pre[MAXN];
    int rt,top;
    inline void up(int x){
        sz[x]  = cnt[x]  + sz[ ch[x][] ] + sz[ ch[x][] ];
    }
    inline void Rotate(int x,int f){
        int y=pre[x];
        ch[y][!f] = ch[x][f];
        pre[ ch[x][f] ] = y;
        pre[x] = pre[y];
        if(pre[x]) ch[ pre[y] ][ ch[pre[y]][] == y ] =x;
        ch[x][f] = y;
        pre[y] = x;
        up(y);
    }
    inline void Splay(int x,int goal){//将x旋转到goal的下面
        while(pre[x] != goal){
            if(pre[pre[x]] == goal) Rotate(x , ch[pre[x]][] == x);
            else   {
                int y=pre[x],z=pre[y];
                int f = (ch[z][]==y);
                if(ch[y][f] == x) Rotate(x,!f),Rotate(x,f);
                else Rotate(y,f),Rotate(x,f);
            }
        }
        up(x);
        if(goal==) rt=x;
    }
    inline void RTO(int k,int goal){//将第k位数旋转到goal的下面
        int x=rt;
        while(sz[ ch[x][] ] != k-) {
            if(k < sz[ ch[x][] ]+) x=ch[x][];
            else {
                k-=(sz[ ch[x][] ]+);
                x = ch[x][];
            }
        }
        Splay(x,goal);
    }
    inline void vist(int x){
        if(x){
            printf("结点%2d : 左儿子  %2d   右儿子  %2d   %2d sz=%d\n",x,ch[x][],ch[x][],val[x],sz[x]);
            vist(ch[x][]);
            vist(ch[x][]);
        }
    }
    inline void Newnode(int &x,int c){
        x=++top;
        ch[x][] = ch[x][] = pre[x] = ;
        sz[x]=; cnt[x]=;
        val[x] = c;
    }
    inline void init(){
        ans=;type=-;
        ch[][]=ch[][]=pre[]=sz[]=;
        rt=top=; cnt[]=;
        Newnode(rt,-INF);
        Newnode(ch[rt][],INF);
        pre[top]=rt;
        sz[rt]=;
    }
    inline void Insert(int &x,int key,int f){
        if(!x) {
            Newnode(x,key);
            pre[x]=f;
            Splay(x,);
            return ;
        }
        if(key==val[x]){
            cnt[x]++;
            sz[x]++;
            return ;
        }else if(key<val[x]) {
            Insert(ch[x][],key,x);
        } else {
            Insert(ch[x][],key,x);
        }
        up(x);
    }  
    void Del(){  //删除根结点
　　　　　　int t=rt;
         if(ch[rt][]) {
             rt=ch[rt][];
             RTO(,);
             ch[rt][]=ch[t][];
             if(ch[rt][]) pre[ch[rt][]]=rt;
         }
         else rt=ch[rt][];
         pre[rt]=;
         up(rt);
    }
    void findpre(int x,int key,int &ans){  //找key前趋
        if(!x)  return ;
        if(val[x] <= key){
            ans=x;
            findpre(ch[x][],key,ans);
        } else
            findpre(ch[x][],key,ans);
    }
    void findsucc(int x,int key,int &ans){  //找key后继
        if(!x) return ;
        if(val[x]>=key) {
            ans=x;
            findsucc(ch[x][],key,ans);
        } else
            findsucc(ch[x][],key,ans);
    }
    int cnt[MAXN];
    int val[MAXN];
    int type;
    int ans;
}spt;
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        spt.init();
        int a,b;
        int ans=;
        int type=-;
        REP(i,,n)
        {
            scanf("%d%d",&a,&b);
            if(a==type||spt.sz[spt.rt]==)
            {
                spt.Insert(spt.rt,b,);
                type=a;
                //spt.vist(spt.rt);
            }
            else
            {
                int x,y;
                if(spt.sz[spt.rt]==)continue;
                spt.findpre(spt.rt,b,x);
                spt.findsucc(spt.rt,b,y);
                if(abs(spt.val[x]-b)<=abs(spt.val[y]-b))
                {
                    ans+=abs(spt.val[x]-b);
                    ans%=mod;
                    spt.Splay(x,);
                    //spt.vist(spt.rt);
                    spt.Del();
                }
                else{
                    ans+=abs(spt.val[y]-b);
                    ans%=mod;
                    spt.Splay(y,);
                    //spt.vist(spt.rt);
                    spt.Del();
                }
            }
        }
        printf("%d\n",ans);
    }
    return ;
}