BZOJ3223: Tyvj 1729 文艺平衡树 无旋Treap

一开始光知道pushdown却忘了pushup.........

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<queue>
#define MAXN 100010
using namespace std;
inline int read()
{
   int sum=;
   char ch=getchar();
   while(ch<''||ch>'')ch=getchar();
   while(ch>=''&&ch<='')
   {
      sum=(sum<<)+(sum<<)+ch-'';
      ch=getchar();
   }
   return sum;
}
struct Treap
{
   struct Node
   {
       Node *ch[];
       int size,v,key;
       bool rev;
       void pushup()
       {
          size=ch[]->size+ch[]->size+;
       }
   }null[MAXN],*root,*q[MAXN];
   void swap(Node *&x,Node *&y)
   {
      Node *temp=x;
      x=y;
      y=temp;
   }
   void pushdown(Node *p)
   {
       if(!p->rev)return;
       p->ch[]->rev^=;
       p->ch[]->rev^=;
       swap(p->ch[],p->ch[]);
       p->rev=;
   }
   int head,tail;
   int sz;
   Node *build(int l,int r)
   {
      if(l>r)return null;
      int mid=(l+r)>>;
      null[mid].ch[]=build(l,mid-);
      null[mid].ch[]=build(mid+,r);
      null[mid].pushup();
      return &null[mid];
   }
   void bfs()
   {
      q[]=root;
      head=tail=;
      while(head<=tail)
      {
         Node *x=q[head++];
         x->v=++sz;
         if(x->ch[]!=null)q[++tail]=x->ch[];
         if(x->ch[]!=null)q[++tail]=x->ch[];
      }
   }
   void Init(int n)
   {
       null->ch[]=null->ch[]=null;
       for(int i=;i<=n;i++)
        null[i].ch[]=null[i].ch[]=null,null[i].size=,null[i].key=i;
       root=build(,n);
       bfs();
   }
   Node *Merge(Node *a,Node *b)
   {
      if(a==null)return b;
      if(b==null)return a;
      if(a->v<b->v)
      {
          pushdown(a);
          a->ch[]=Merge(a->ch[],b);
          a->pushup();
          return a;
      }
      else
      {
          pushdown(b);
          b->ch[]=Merge(a,b->ch[]);
          b->pushup();
          return b;
      }
   }
   pair<Node*,Node*> split(Node *p,int k)
   {
      if(p==null)return make_pair(null,null);
      pushdown(p);
      if(p->ch[]->size>=k)
      {
        pair<Node*,Node*> y=split(p->ch[],k);
        p->ch[]=y.second;
        p->pushup();
        y.second=p;
        return y;
      }
      pair<Node*,Node*> y=split(p->ch[],k-p->ch[]->size-);
      p->ch[]=y.first;
      p->pushup();
      y.first=p;
      return y;
   }
   void Rev(int l,int r)
   {
      pair<Node*,Node*> x=split(root,l-);
      pair<Node*,Node*> y=split(x.second,r-l+);
      y.first->rev^=;
      root=Merge(Merge(x.first,y.first),y.second);
   }
   void Print(Node *p)
   {
      pushdown(p);
      if(p==null)return;
      Print(p->ch[]);
      printf("%d ",p->key);
      Print(p->ch[]);
   }
}YY;
int main()
{
   int n=read(),m=read();
   YY.Init(n);
   while(m--)
   {
      int l=read(),r=read();
      YY.Rev(l,r);
   }
   YY.Print(YY.root);
   return ;
}