解题：ZJOI 2006 游戏排名系统

题面

跟i207M学了学重载运算符后找前驱后继，然后就是练练无旋树堆

#include<map>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=250005;
struct a
{
    int id;
    long long sc;
    string username;
}dat[N];
bool operator < (a a1,a a2)
{
    return (a1.sc==a2.sc)?a1.id<a2.id:a1.sc>a2.sc;
}
int siz[N],son[N][2],rnk[N];
int n,x,y,z,t1,t2,tot,cnt,tim,root;
map<string,a> mp;  string rd; 
void Pushup(int nde)
{
    siz[nde]=siz[son[nde][0]]+siz[son[nde][1]]+1;
}
int Create(a tsk)
{
    siz[++tot]=1;
    dat[tot]=tsk;
    rnk[tot]=rand();
    return tot;
}
int Merge(int x,int y)
{
    if(!x||!y)
        return x+y;
    else if(rnk[x]<=rnk[y])
    {
        son[x][1]=Merge(son[x][1],y);
        Pushup(x); return x;
    }
    else 
    {
        son[y][0]=Merge(x,son[y][0]);
        Pushup(y); return y;
    }
}
void Split(int nde,int &x,int &y,a tsk)
{
    if(!nde) x=y=0;
    else
    {
        if(dat[nde]<tsk)
            x=nde,Split(son[nde][1],son[nde][1],y,tsk);
        else 
            y=nde,Split(son[nde][0],x,son[nde][0],tsk);
        Pushup(nde);
    }
}
int Query(int nde,int tsk)
{
    if(tsk<=siz[son[nde][0]]) return Query(son[nde][0],tsk);
    else if(tsk==siz[son[nde][0]]+1) return nde;
    else return Query(son[nde][1],tsk-siz[son[nde][0]]-1);
}
void Insert(a tsk)
{
    Split(root,x,y,tsk);
    root=Merge(Merge(x,Create(tsk)),y);
}
void Delete(a tsk)
{
    Split(root,x,y,tsk); tsk.id++;
    Split(y,y,z,tsk); root=Merge(x,z);
}
int rnk_query(a tsk)
{
    Split(root,x,y,tsk);
    int ret=siz[x]+1;
    root=Merge(x,y); return ret;
}
string num_query(int tsk)
{
    return dat[Query(root,tsk)].username;
}
int main()
{
    cin>>n; 
    for(int i=1;i<=n;i++)
    {
        cin>>rd;
        if(rd[0]=='+')
        {
            long long sc; cin>>sc;
            rd.erase(rd.begin()),cnt++;    
            if(mp.count(rd)) Delete(mp[rd]),cnt--;
            Insert(mp[rd]=(a){++tim,sc,rd}); 
        }
        else 
        {
            if(isdigit(rd[1]))
            {
                int q=0;
                for(int j=1;j<(int)rd.size();j++) 
                    q=q*10+rd[j]-'0';
                for(int j=q,c=1;j<=cnt&&c<=10;j++,c++)
                    cout<<num_query(j)<<' '; cout<<endl;
            }
            else
            {
                rd.erase(rd.begin());
                cout<<rnk_query(mp[rd])<<endl;
            }
        }
    }
    return 0;
}