牛客网暑期ACM多校训练营（第三场）2018 C , Shuffle Cards ( rope )

题目描述
Eddy likes to play cards game since there are always lots of randomness in the game. For most of the cards game, the very first step in the game is shuffling the cards. And, mostly the randomness in the game is from this step. However, Eddy doubts that if the shuffling is not done well, the order of the cards is predictable!

To prove that, Eddy wants to shuffle cards and tries to predict the final order of the cards. Actually, Eddy knows only one way to shuffle cards that is taking some middle consecutive cards and put them on the top of rest. When shuffling cards, Eddy just keeps repeating this procedure. After several rounds, Eddy has lost the track of the order of cards and believes that the assumption he made is wrong. As Eddy’s friend, you are watching him doing such foolish thing and easily memorizes all the moves he done. Now, you are going to tell Eddy the final order of cards as a magic to surprise him.

Eddy has showed you at first that the cards are number from 1 to N from top to bottom.

For example, there are 5 cards and Eddy has done 1 shuffling. He takes out 2-nd card from top to 4-th card from top(indexed from 1) and put them on the top of rest cards. Then, the final order of cards from top will be [2,3,4,1,5].
输入描述:
The first line contains two space-separated integer N, M indicating the number of cards and the number of shuffling Eddy has done.
Each of following M lines contains two space-separated integer pi, si indicating that Eddy takes pi-th card from top to (pi+si-1)-th card from top(indexed from 1) and put them on the top of rest cards.

1 ≤ N, M ≤ 105
1 ≤ pi ≤ N
1 ≤ si ≤ N-pi+1
输出描述:
Output one line contains N space-separated integers indicating the final order of the cards from top to bottom.

示例1
输入
5 1
2 3
输出
2 3 4 1 5

示例2
输入
5 2
2 3
2 3
输出
3 4 1 2 5

示例3
输入
5 3
2 3
1 4
2 4
输出
3 4 1 5 2
题意 :
对区间一段序列移动到另一位置。
对于样例一
5 1
2 3
数组里面有5个元素 , 有一次操作 把从 2 开始的 3 个数提到数组的前面

题解 :
比赛的时候sb了，用线段树想了半天，表示完全没接触过splay树 和 rope
就顺便学习了一下rope , 觉得STL挺好的 , 时间复杂度都在O(log2(n))上

//ac code:
#include <bits/stdc++.h>
#include <ext/rope>

using namespace std;
using namespace __gnu_cxx;

rope<int>T;

int main(){
    int n,m; cin>>n>>m;

    for (int i = 1;i<=n;i++) T.push_back(i); 

    int l,r;

    for (int i = 0;i<m;i++) {
        scanf("%d %d",&l,&r); l--;
        T = T.substr(l,r) + T.substr(0,l) + T.substr(l+r,n-l-r);  
    }

    for (int i = 0;i<n;i++) printf("%d ",T[i]);

    return 0;
}

#include <bits/stdc++.h>
#include <ext/rope>

using namespace std;
using namespace __gnu_cxx;

rope<int>T;

int main(){
    int x,pos,num;
    T.push_back(x); T.push_front(x);
    T.replace(pos,x); //将pos位置替换成为x 
    T.substr(pos,num); // 将pos位置后面的num个取出 
    T.erase(pos,num); // 从pos位置删除num个 
    T.insert(pos,x); // 在pos位置插入x 
    return 0;
}