【splay tree】 HDOJ 4453 Looploop

题目中有六种操作。。。第一种对顺时针k2个元素加上一个数，伸展树加个加法的延迟标记就行。。。第二种对顺时针k1个元素翻转，伸展树加个翻转的延迟标记。。。第三种在当前元素后面插入一个元素。。。第四种删除当前元素。。。第五种当前指针向前或向后移动一位，向前移可以转化为先删除第一个元素，再在后面加入同样的元素，向后反之。。。第六种询问当前指针指向的值。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 120005
#define maxm 400005
#define eps 1e-10
#define mod 1000000007  
#define lowbit(x) (x&(-x))  
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
//typedef int LL;
using namespace std;

struct node
{
	int s, v, flip, add;
	node *ch[2], *fa;
	int cmp(int x)
	{
		if(x == ch[0]->s + 1) return -1;
		if(x > ch[0]->s + 1) return 1;
		else return 0;
	}
	void maintain(void)
	{
		s = ch[0]->s + ch[1]->s + 1;
	}
	void pushdown(void)
	{
		if(flip) {
			swap(ch[0], ch[1]);
			ch[0]->flip^=1;
			ch[1]->flip^=1;
			flip = 0;
		}
		if(add) {
			ch[0]->v += add;
			ch[1]->v += add;
			ch[0]->add += add;
			ch[1]->add += add;
			add = 0;
		}
	}
}*null, *root, C[maxn], *top;
void rotate(node* &o, int d)
{
	node *p = o->fa; p->ch[d^1] = o->ch[d], o->fa = p->fa;
	if(p->fa != null) {
		if(p->fa->ch[0] == p) p->fa->ch[0] = o;
		else p->fa->ch[1] = o;
	}
	if(p->ch[d^1] != null) p->ch[d^1]->fa = p;
	p->fa = o, o->ch[d] = p;
	p->maintain(), o->maintain();
}
void splay(node* &o, int k)
{
	o->pushdown();
	int d = o->cmp(k);
	while(d != -1) {
		if(d) {
			k -= o->ch[0]->s + 1;
			o = o->ch[1];
		}
		else o = o->ch[0];
		o->pushdown();
		d = o->cmp(k);
	}
	node *p;
	while(o->fa != null) {
		p = o->fa;
		if(p->ch[0] == o) {
			if(p != null && p->fa->ch[0] == p)
				rotate(p, true);
			rotate(o, true);
		}
		else {
			if(p != null && p->fa->ch[1] == p)
				rotate(p, false);
			rotate(o, false);
		}
	}
}
node* merge(node *left, node *right)
{
	splay(left, left->s);
	left->ch[1] = right;
	right->fa = left;
	left->maintain();
	return left;
}
void split(node *o, int k, node* &left, node* &right)
{
	splay(o, k);
	right = o->ch[1];
	o->ch[1] = null;
	left = o;
	right->fa = null;
	left->maintain();
}
int num[maxn];
int n, m, k1, k2;
char s[20];
void init(void)
{
	top = C;
	null = top++;
	null->v = null->s = 0;
	null->flip = null->add = 0;
	null->ch[0] = null->ch[1] = NULL;
	root = null;
}
void build(void)
{
	node *p;
	for(int i = 1; i <= n; i++) scanf("%d", &num[i]);
	for(int i = 1; i <= n; i++) {
		p = top++;
		p->v = num[i];
		p->flip = p->add = 0;
		p->ch[0] = root;
		root->fa = p;
		p->ch[1] = p->fa = null;
		root = p;
		root->maintain();
	}
}
void work(void)
{
	node *left, *right, *p;
	int k, x;
	while(m--) {
		scanf("%s", s);
		if(s[0] == 'q') {
			splay(root, 1);
			printf("%d\n", root->v);
		}
		if(s[0] == 'm') {
			if(n == 1) continue;
			scanf("%d", &k);
			if(k == 1) {
				split(root, n-1, left, right);
				root = merge(right, left);
			}
			else {
				split(root, 1, left, right);
				root = merge(right, left);
			}
		}
		if(s[0] == 'i') {
			scanf("%d", &x);
			p = top++;
			p->v = x, p->ch[0] = p->ch[1] = p->fa = null;
			p->flip = p->add = 0, p->s = 1;
			split(root, 1, left, right);
			root = merge(merge(left, p), right);
			n++;
		}
		if(s[0] == 'd') {
			split(root, 1, left, p);
			root = p;
			n--;
		}
		if(s[0] == 'a') {
			scanf("%d", &x);
			split(root, k2, left, right);
			left->add += x;
			left->v += x;
			root = merge(left, right);
		}
		if(s[0] == 'r') {
			split(root, k1, left, right);
			left->flip^=1;
			root = merge(left, right);
		}
	}
}
int main(void)
{
	int _ = 0;
	while(scanf("%d%d%d%d", &n, &m, &k1, &k2), n!=0 || m!=0 || k1!=0 || k2!=0) {
		init();
		build();
		printf("Case #%d:\n", ++_);
		work();
	}
	return 0;
}