题意:有个原始数列1,2,3..n,有m个指令,每个指令(a,b)表示取出第a~b个元素,翻转后添加到排列的尾部。
思路:白书上的例题,学过splay树后就不怎么难了,先贴个模板,需要注意的是得多加个0在原始数列前面,方便分裂序列。
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1e5+10;
struct Node
{
Node *ch[2];
int v,s,flip;
Node(int v):v(v){ch[0]=ch[1]=NULL,s=1,flip=0;}
int cmp(int x)
{
int t=(ch[0]==NULL)?0:ch[0]->s;
if(t>=x)
return 0;
else if(t+1==x)
return -1;
return 1;
}
void maintain()
{
s=1;
if(ch[0]!=NULL)s+=ch[0]->s;
if(ch[1]!=NULL)s+=ch[1]->s;
}
void pushdown()
{
if(flip)
{
flip=0;
swap(ch[0],ch[1]);
if(ch[0]!=NULL)
ch[0]->flip^=1;
if(ch[1]!=NULL)
ch[1]->flip^=1;
}
}
};
void rotate(Node* &o,int d)
{
Node *k=o->ch[d^1];o->ch[d^1]=k->ch[d];k->ch[d]=o;
o->maintain();k->maintain();o=k;
}
void splay(Node* &o,int k)
{
o->pushdown();
int d=o->cmp(k);
if(d==1)
{
if(o->ch[0]!=NULL)k-=o->ch[0]->s;
k--;
}
if(d!=-1)
{
Node* p=o->ch[d];p->pushdown();
int k2=k,d2=p->cmp(k);
if(d2==1)
{
if(p->ch[0]!=NULL)
k2-=p->ch[0]->s;
k2--;
}
if(d2!=-1)
{
splay(p->ch[d2],k2);
if(d==d2)rotate(o,d^1);else rotate(o->ch[d],d);
}
rotate(o,d^1);
}
}
Node* merge(Node* left,Node* right)
{
splay(left,left->s);
left->ch[1]=right;
left->maintain();
return left;
}
void split(Node *o,int k,Node* &left,Node* &right)
{
splay(o,k);
left=o;
right=o->ch[1];
o->ch[1]=NULL;
left->maintain();
}
void build(Node* &o,int l,int r)
{
int m=(l+r)/2;
o=new Node(m);
if(l<m)
build(o->ch[0],l,m-1);
if(r>m)
build(o->ch[1],m+1,r);
o->maintain();
}
int n,m;
Node *root;
void dfs(Node *o)
{
o->pushdown();
if(o->ch[0]!=NULL)
dfs(o->ch[0]);
if(o->v!=0&&o->v!=n+1)
printf("%d\n",o->v);
if(o->ch[1]!=NULL)
dfs(o->ch[1]);
}
int main()
{
scanf("%d%d",&n,&m);
build(root,0,n);
while(m--)
{
int a,b;
scanf("%d%d",&a,&b);
Node *left,*mid,*right,*o,*tmp;
split(root,a,left,o);
split(o,b-a+1,mid,right);
mid->flip^=1;
root=merge(merge(left,right),mid);
}
dfs(root);
}