解题：ZJOI 2006 游戏排名系统

题面

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

 #include<map>
 #include<cstdio>
 #include<string>
 #include<cstring>
 #include<iostream>
 #include<algorithm>
 using namespace std;
 const int N=;
 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][],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][]]+siz[son[nde][]]+;
 }
 int Create(a tsk)
 {
     siz[++tot]=;
     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][]=Merge(son[x][],y);
         Pushup(x); return x;
     }
     else
     {
         son[y][]=Merge(x,son[y][]);
         Pushup(y); return y;
     }
 }
 void Split(int nde,int &x,int &y,a tsk)
 {
     if(!nde) x=y=;
     else
     {
         if(dat[nde]<tsk)
             x=nde,Split(son[nde][],son[nde][],y,tsk);
         else
             y=nde,Split(son[nde][],x,son[nde][],tsk);
         Pushup(nde);
     }
 }
 int Query(int nde,int tsk)
 {
     if(tsk<=siz[son[nde][]]) return Query(son[nde][],tsk);
     else if(tsk==siz[son[nde][]]+) return nde;
     else return Query(son[nde][],tsk-siz[son[nde][]]-);
 }
 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]+;
     root=Merge(x,y); return ret;
 }
 string num_query(int tsk)
 {
     return dat[Query(root,tsk)].username;
 }
 int main()
 {
     cin>>n;
     for(int i=;i<=n;i++)
     {
         cin>>rd;
         if(rd[]=='+')
         {
             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[]))
             {
                 int q=;
                 for(int j=;j<(int)rd.size();j++)
                     q=q*+rd[j]-'';
                 for(int j=q,c=;j<=cnt&&c<=;j++,c++)
                     cout<<num_query(j)<<' '; cout<<endl;
             }
             else
             {
                 rd.erase(rd.begin());
                 cout<<rnk_query(mp[rd])<<endl;
             }
         }
     }
     return ;
 }