BZOJ 3223 文艺平衡树

Description

 

您需要写一种数据结构（可参考题目标题），来维护一个有序数列，其中需要提供以下操作：翻转一个区间，例如原有序序列是5 4 3 2 1，翻转区间是[2,4]的话，结果是5 2 3 4 1

Input

第一行为n,m n表示初始序列有n个数，这个序列依次是(1,2……n-1,n)  m表示翻转操作次数
接下来m行每行两个数[l,r] 数据保证 1<=l<=r<=n

Output

输出一行n个数字，表示原始序列经过m次变换后的结果

Sample Input

5 3

1 3

1 3

1 4

Sample Output

4 3 2 1 5

HINT

N,M<=100000

Source

splay区间操作大裸题不解释。

 #include<queue>
 #include<cstdio>
 #include<cstdlib>
 using namespace std;

 #define maxn 100010
 const int inf =  << ;
 queue <int> team;
 struct TREE
 {
     int ch[maxn][],fa[maxn],cnt,root;
     int key[maxn],size[maxn],t[maxn];

     inline int newnode()
     {
         if (team.empty()) return ++cnt;
         int ret = team.front(); team.pop();
         return ret;
     }

     inline TREE()
     {
         root = newnode();
         key[root] = -inf; ++t[root];
         updata(root);
         add(inf);
     }

     inline int find(int rank,int have,int now)
     {
         if (have+size[ch[now][]]<rank&&have+size[ch[now][]]+t[now]>=rank) return now;
         if (have+size[ch[now][]]+t[now]<rank) return find(rank,have+size[ch[now][]]+t[now],ch[now][]);
         else return find(rank,have,ch[now][]);
     }

     inline void updata(int now) { size[now] = size[ch[now][]] + size[ch[now][]] + t[now]; }

     inline void rotate(int x)
     {
         int y = fa[x],z = fa[y],l = ch[y][] != x,r = l ^ ;
         if (z != ) ch[z][ch[z][] != y] = x;
         fa[x] = z; fa[y] = x; fa[ch[x][r]] = y;
         ch[y][l] = ch[x][r]; ch[x][r] = y;
         updata(y); updata(x);
     }

     inline void splay(int x,int aim)
     {
         int p = fa[aim];
         while (fa[x] != p)
         {
             int y = fa[x],z = fa[y];
             if (z != p)
             {
                 if ((ch[z][] == y)^(ch[y][] == x)) rotate(x);
                 else rotate(y);
             }
             rotate(x);
         }
         if (aim == root) root = x;
     }

     inline int search(int x)
     {
         int now = root;
         while (now)
         {
             if (key[now] == x) break;
             now = ch[now][x > key[now]];
         }
         return now;
     }

     inline void add(int x)
     {
         int now = root,pre = ;
         while (now)
         {
             pre = now;
             now = ch[now][x > key[now]];
         }
         now = newnode();
         fa[now] = pre; ch[pre][x > key[pre]] = now;
         key[now] = x; ++t[now];
         pre = now;
         while (now)
         {
             updata(now);
             now = fa[now];
         }
         splay(pre,root);
     }

     inline int qrank(int x)
     {
         int now = root,ret = ;
         while (key[now] != x)
         {
             if (x < key[now]) now = ch[now][];
             else ret += size[ch[now][]] + t[now],now = ch[now][];
         }
         return ret + size[ch[now][]] + ;
     }

     inline void insert(int x)
     {
         int p = search(x);
         if (p)
         {
             splay(p,root);
             ++t[p];
             updata(p);
         }
         else add(x);
     }

     inline void del(int x)
     {
         int now = search(x),k = qrank(x);
         int p = find(k-,,root),q = find(k + t[now],,root);
         splay(p,root);
         splay(q,ch[p][]);
         if (--t[now])
         {
             updata(now);
             updata(q);
             updata(p);
         }
         else
         {
             ch[q][] = ; fa[now] = ;
             updata(q);
             updata(p);
             team.push(now);
         }
     }

     inline int ask(int x,int sign)
     {
         int now = root,ret;
         while (now)
         {
             if (sign)
             {
                 if (key[now] > x)
                     ret = now,now = ch[now][];
                 else now = ch[now][];
             }
             else
             {
                 if (key[now] < x)
                     ret = now,now = ch[now][];
                 else now = ch[now][];
             }
         }
         return key[ret];
     }
 }tree;

 inline int read()
 {
     int x=,f=;char ch=getchar();
     while(ch>''||ch<''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }

 int main()
 {
     freopen("3224.in","r",stdin);
     freopen("3224.out","w",stdout);
     int T = read();
     while (T--)
     {
         int opt = read();
         if (opt == ) tree.insert(read());
         else if (opt == ) tree.del(read());
         else if (opt == ) printf("%d\n",tree.qrank(read())-);
         else if (opt == ) printf("%d\n",tree.key[tree.find(read()+,,tree.root)]);
         else if (opt == ) printf("%d\n",tree.ask(read(),));
         else printf("%d\n",tree.ask(read(),));
     }
     fclose(stdin); fclose(stdout);
     return ;
 }