链接：https://www.nowcoder.com/acm/contest/141/C
来源：牛客网
Shuffle Cards
时间限制：C/C++ 1秒，其他语言2秒
空间限制：C/C++ 262144K，其他语言524288K
Special Judge, 64bit IO Format: %lld
题目描述
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.
输入
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
题目大意：
给出n张卡片，编号从1~n。
现在有q次操作，给出一个p,s，使区间[p,p+s-1]的数整体移到最前面。
问q次操作之后卡片的状况
题目分析：
利用平衡二叉树实现区间操作，这里笔者用的是无旋treap。
具体操作时：
移动区间可以利用无旋treap的split操作使按区间分割成三颗子树，然后按照题目意思合并。
回答询问时只需按照是第K个元素把树分割成 K-1个元素的树和n-K+1个元素的树，显然询问的树就是n-K+1个元素的树再分割一个元素的树根。
#include
#include
#include
#include
#include
