Queue Sequence HDU - 4441

码力不行啊。。。

错误记录：

171行后面对find2的使用错误，原来写的是p=find2(rt,p1)，然后再加上一句能过样例但很假的特判

事实上，现在是要寻找最大的j，使得d2[1..j-1]=p1-1

而find2返回的是最大的j，使得d2[1..j]<=p1，因此要这么用

 #pragma GCC optimize("Ofast")
 #include<cstdio>
 #include<algorithm>
 #include<cstring>
 #include<vector>
 #include<set>
 using namespace std;
 #define fi first
 #define se second
 #define mp make_pair
 #define pb push_back
 typedef long long ll;
 typedef unsigned long long ull;
 typedef pair<int,int> pii;
 namespace S
 {
 const int N=;
 int rand1()
 {
     static int x=;
     return x=(48271LL*x+)%;
 }
 struct Node
 {
     Node *ch[],*fa;
     int sz,d,r;
     int d1,d2;ll sum;
 }nds[N];
 int gsz(Node *o)    {return o?o->sz:;}
 int gd1(Node *o)    {return o?o->d1:;}
 int gd2(Node *o)    {return o?o->d2:;}
 ll gsum(Node *o)    {return o?o->sum:;}
 void upd(Node *o)
 {
     o->sz=gsz(o->ch[])+gsz(o->ch[])+;
     o->d1=gd1(o->ch[])+gd1(o->ch[])+(o->d>);
     o->d2=gd2(o->ch[])+gd2(o->ch[])+(o->d<);
     o->sum=ll(gsum(o->ch[]))+gsum(o->ch[])+o->d;
 }
 int mem;
 Node *getnode()
 {
     Node *t=nds+(mem++);
     t->ch[]=t->ch[]=t->fa=;
     t->d1=t->d2=t->d=;t->sz=;t->r=rand1();
     return t;
 }
 Node *merge(Node *a,Node *b)
 {
     if(!a)    return b;
     if(!b)    return a;
     if(a->r<b->r)
     {
         a->ch[]=merge(a->ch[],b);upd(a);
         if(a->ch[])    a->ch[]->fa=a;
         return a;
     }
     else
     {
         b->ch[]=merge(a,b->ch[]);upd(b);
         if(b->ch[])    b->ch[]->fa=b;
         return b;
     }
 }
 typedef pair<Node*,Node*> pnn;
 pnn split(Node *a,int k)
 {
     if(!a)    return pnn(,);
     if(!k)    return pnn(,a);
     int ls=gsz(a->ch[]);pnn y;
     if(k<=ls)
     {
         //if(a->ch[0])    a->ch[0]->fa=0;
         y=split(a->ch[],k);
         a->ch[]=y.se;
         if(a->ch[])    a->ch[]->fa=a;
         upd(a);y.se=a;
     }
     else
     {
         //if(a->ch[1])    a->ch[1]->fa=0;
         y=split(a->ch[],k-ls-);
         a->ch[]=y.fi;
         if(a->ch[])    a->ch[]->fa=a;
         upd(a);y.fi=a;
     }
     return y;
 }
 void insert(Node *&a,int p,int x)
 {
     pnn t1=split(a,p-);Node *t=getnode();
     t->d=x;upd(t);
     a=merge(merge(t1.fi,t),t1.se);
 }
 void remove(Node *&a,int p)
 {
     pnn t1=split(a,p-),t2=split(t1.se,);
     a=merge(t1.fi,t2.se);
 }
 int find1(Node *&a,int k)
 {
     pnn t1=split(a,k);int ans=t1.fi->d1;
     a=merge(t1.fi,t1.se);
     return ans;
 }
 int find2(Node *a,int k)
 {
     if(!a)    return ;
     int ls=gd2(a->ch[]);
     if(k<ls)    return find2(a->ch[],k);
     else if(k<ls+(a->d<))    return gsz(a->ch[]);
     else    return gsz(a->ch[])++find2(a->ch[],k-ls-(a->d<));
 }
 int find3(Node *&a,int k)
 {
     pnn t1=split(a,k);int ans=t1.fi->d2;
     a=merge(t1.fi,t1.se);
     return ans;
 }
 ll qsum(Node *&a,int l,int r)
 {if(l>r)    swap(l,r);
     pnn t1=split(a,l-),t2=split(t1.se,r-l+);
     ll ans=t2.fi->sum;
     a=merge(t1.fi,merge(t2.fi,t2.se));
     return ans;
 }
 Node *rt;
 Node *find(Node *a,int k)
 {
     if(!a)    return ;
     int ls=gsz(a->ch[]);
     if(k<=ls)    return find(a->ch[],k);
     else if(k<=ls+)    return a;
     else    return find(a->ch[],k-ls-);
 }
 bool gson(Node *a)    {return a==a->fa->ch[];}
 int findx(Node *a)
 {
     int ans=gsz(a->ch[])+;
     for(;a!=rt;a=a->fa)
         if(gson(a))
             ans+=gsz(a->fa->ch[])+;
     return ans;
 }
 }
 set<int> s;
 char tmp[];
 int n;
 using S::rt;
 S::pnn ttt[];
 int main()
 {
     int p,x,i,p1,TT=;
     while(scanf("%d",&n)==)
     {
         S::mem=;
         s.clear();rt=;
         for(i=;i<=n;i++)    s.insert(i);
         ++TT;
         printf("Case #%d:\n",TT);
         for(i=;i<=n;i++)
         {
             scanf("%s",tmp);
             if(tmp[]=='i')
             {
                 scanf("%d",&p);p++;
                 x=*s.begin();s.erase(x);
                 S::insert(rt,p,x);ttt[x].fi=S::find(rt,p);
                 //printf("a%d %d\n",p,x);
                 //printf("%d\n",S::findx(ttt[x].fi));
                 p1=S::find1(rt,p);p=S::find2(rt,p1-)+;
                 S::insert(rt,p,-x);ttt[x].se=S::find(rt,p);
                 //printf("a%d %d\n",p,-x);
             }
             else if(tmp[]=='r')
             {
                 scanf("%d",&x);
                 //printf("b%d ",S::findx(ttt[x].fi));
                 S::remove(rt,S::findx(ttt[x].fi));
                 //printf("%d\n",S::findx(ttt[x].se));
                 S::remove(rt,S::findx(ttt[x].se));
                 s.insert(x);
             }
             else
             {
                 scanf("%d",&x);
                 printf("%lld\n",S::qsum(rt,S::findx(ttt[x].fi),S::findx(ttt[x].se)));
             }
         }
     }
     return ;
 }