【BZOJ3223】Tyvj1729文艺平衡树

题意：写一种数据结构支持区间翻转。

显然用平衡树，然而我第一次写翻转，居然调了半个下午！！！。。。坑爹的边界数据。。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#include <cstring>
#define ll long long
#define gc getchar()
#define inf 1000000000
#define N 2000009
using namespace std;
int root,n,m;
int father[N],son[N][2],v[N],size[N],cnt=0,flag=1,rv[N];
int num[N];
int read()
{
	int x=0,f=1;
	char ch;
	for (;ch<'0'||ch>'9';ch=gc)
		if (ch=='-') f=-1;
    for (;ch>='0'&&ch<='9';ch=gc)
		x=x*10+ch-'0';
	return x*f;
}
void rev(int x)
{
	swap(son[x][0],son[x][1]);
	rv[x]^=1;
}
void pd(int x)
{
	if (rv[x]) rev(son[x][0]),rev(son[x][1]),rv[x]=0; 
}
void up(int x)
{
	size[x]=size[son[x][0]]+size[son[x][1]]+1;
}
void rotate(int x)
{
	int y=father[x],k=(son[y][0]==x);
	son[y][!k]=son[x][k];
	father[son[y][!k]]=y;
	father[x]=father[y];
	if (father[y]!=-1) son[father[y]][son[father[y]][1]==y]=x;
	son[x][k]=y;
	father[y]=x;
	up(y);
}
void splay(int x,int g)
{
	for (int y;(y=father[x])!=g;rotate(x))
		if (father[y]!=g) rotate(((x==son[y][0])==(y==son[father[y]][0]))?y:x);
	up(x);
	if (g==n+2) root=x;
}
int find(int x,int rank)
{
	pd(x);
	int l=son[x][0];
	int r=son[x][1];
	if (size[l]+1==rank) return x;
	else if (rank<=size[l]) return find(l,rank);
	else return find(r,rank-size[l]-1);
}
void build(int l,int r,int k)
{
	if (l>r) return;
	int now,last=num[k];
	if (l==r)
	{
		now=num[l];
		father[now]=last;
		size[now]=1;
		if (l<k)
			son[last][0]=now;
		else
			son[last][1]=now;
		return;
	}
	int mid=l+r>>1;
	now=num[mid];
	build(l,mid-1,mid);
	build(mid+1,r,mid);
	father[now]=last;
	up(mid);
	if (mid<k)
		son[last][0]=now;
	else
		son[last][1]=now;
}
void dfs(int now)
{
	pd(now);
	if (son[now][0]!=-1) dfs(son[now][0]);
	if (v[now]>0&&v[now]<=n) printf("%d ",v[now]);
	if (son[now][1]!=-1) dfs(son[now][1]);
}
int main()
{
	memset(son,-1,sizeof(son));
	memset(father,-1,sizeof(father));
	n=read();
	m=read();
	root=(n+1)>>1;
	for (int i=0;i<=n+2;i++)
		num[i]=i;
	build(0,n+1,n+2);
	dfs(root);
	for (int i=1;i<=m;i++)
	{
		int l=read(),r=read();
		l=find(root,l),r=find(root,r+2);
		splay(l,n+2);
		splay(r,root);
		rev(son[son[root][1]][0]);
	}
	for (int i=1;i<=n;i++)
		printf("%d ",find(root,i+1));
	printf("\n");
}