splay区间翻转模板

https://blog.csdn.net/qq_35914587/article/details/78972053

https://blog.csdn.net/clove_unique/article/details/50630280

#include <cstdio>
#include <iostream>
#define il inline
#define lson l,mid-1,now
#define rson mid+1,r,now 
using namespace std;
const int maxm=1e6+1;
const int inf=1e8;
int size[maxm],val[maxm],rev[maxm],key[maxm];
int f[maxm],son[maxm][2];
int root,tot;
il void pushdown(int x)
{
    if(x&&rev[x])
    {
        rev[son[x][0]]^=1;
        rev[son[x][1]]^=1;
        swap(son[x][0],son[x][1]);
        rev[x]=0;
    }
}
il bool get(int x)
{
    return son[f[x]][1]==x;
}
il void update(int x)
{
    if(x)
    {
        size[x]=1;
        if(son[x][0]) size[x]+=size[son[x][0]];
        if(son[x][1]) size[x]+=size[son[x][1]];
    }
}
il void rorate(int x)
{
    int fa=f[x],ffa=f[fa],which=get(x);
    bool fx=get(fa);
    son[fa][which]=son[x][which^1]; 
    f[son[fa][which]]=fa;  
    son[x][which^1]=fa;
    f[fa]=x;  
    f[x]=ffa;

    if(ffa)  
     son[ffa][fx]=x; 
    update(fa),update(x);  
}
il void splay(int x,int who)
{
    for (int fa;(fa=f[x])!=who;rorate(x))
        if (f[fa]!=who)
            rorate(get(fa)==get(x)?fa:x);
    if (!who) root=x;
}
int build(int l,int r,int fa)
{
    if(l>r) return 0;
    int mid=(l+r)>>1;
    int now=++tot;
    key[now]=val[mid];
    f[now]=fa;
    son[now][0]=build(lson);
    son[now][1]=build(rson);
    update(now);
    return now;
}
inline int findx(int kth)
{
    int now=root;
    while(1)
    {
       pushdown(now);
       if(kth<=size[son[now][0]]) now=son[now][0];
       else
       {
         kth-=size[son[now][0]]+1;
         if(!kth) return now;
         now=son[now][1];
       }
    }
}
void print(int now)
{
    pushdown(now);
    if(son[now][0]) print(son[now][0]);
    if(key[now]!=inf&&key[now]!=-inf) printf("%d ",key[now]);
    if(son[now][1]) print(son[now][1]);
}
il int read()
{
    int x=0;
    char ch=0;
    while(ch<'0'||ch>'9') ch=getchar();
    while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
    return x;
}
int main()
{
    int n,m;
    n=read(),m=read();
    val[1]=-inf,val[n+2]=inf;
    for(int i=2;i<=n+1;i++)
     val[i]=i-1;
    root=build(1,n+2,0);
    //printf("%d\n",findx(m));
    for(int i=1;i<=m;i++)
    {
        int l,r;
        l=read(),r=read();
        int lx=findx(l),rx=findx(r+2);
        splay(lx,0);
        splay(rx,lx);
        rev[son[son[root][1]][0]]^=1;
    }
    print(root);
    return 0;
}