bzoj3223: Tyvj 1729 文艺平衡树 splay裸题

splay区间翻转即可

/**************************************************************
    Problem: 3223
    User: walfy
    Language: C++
    Result: Accepted
    Time:2304 ms
    Memory:5444 kb
****************************************************************/

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pi acos(-1.0)
#define ll long long
#define vi vector<int>
#define mod 1000000007
#define C 0.5772156649
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#define pil pair<int,ll>
#define pli pair<ll,int>
#define pii pair<int,int>
#define cd complex<double>
#define ull unsigned long long
#define base 1000000000000000000
#define fio ios::sync_with_stdio(false);cin.tie(0)

using namespace std;

const double eps=1e-;
const int N=+,maxn=+,inf=0x3f3f3f3f,INF=0x3f3f3f3f3f3f3f3f;

struct Splay{
    struct Node{
        Node* ch[];
        int v;
        int s;
        int flip;
        int cmp(int x)const{
            int d = x - ch[]->s;
            if(d==)return -;
            return d<= ? :;
        }
        void maintain()
        {
            s =  + ch[]->s + ch[]->s;
        }
        void pushdown()
        {
            if(flip)//类似于线段树的lazy标记
            {
                flip=;
                swap(ch[],ch[]);
                ch[]->flip = !(ch[]->flip);
                ch[]->flip = !(ch[]->flip);
            }
        }
    };
    Node* null;
    void Rotate(Node* &o,int d)
    {
        Node* k = o->ch[d^];
        o->ch[d^] = 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==)k -= o->ch[]->s + ;//利用二叉树性质
        if(d!=-)
        {
            Node* p = o->ch[d];
            p->pushdown();
            int d2 = p->cmp(k);
            int k2 = (d2== ? k:k-p->ch[]->s-);
            if(d2!=-)
            {
                splay(p->ch[d2],k2);
                if(d==d2)Rotate(o,d^);
                else Rotate(o->ch[d],d);
            }
            Rotate(o,d^);
        }
    }
    Node* Merge(Node* left,Node* right)
    {
        splay(left,left->s);//把排名最大的数splay到根
        left->ch[] = right;
        left->maintain();
        return left;
    }
    void split(Node* o,int k,Node* &left,Node* &right)
    {
        splay(o,k);//把排名为k的节点splay到根，右侧子树所有节点排名比k大，左侧小
        right = o->ch[];
        o->ch[] = null;
        left = o;
        left->maintain();
    }
    Node *root,*left,*right;
    void init(int sz)
    {
        null=new Node;
        null->s=;
        root=new Node;
        root->v=;root->flip=;
        root->ch[]=root->ch[]=null;
        root->maintain();
        Node* p;
        for(int i=;i<=sz;i++)
        {
            p=new Node;
            p->v=i;p->s=p->flip=;
            p->ch[]=root,p->ch[]=null;
            root=p;
            root->maintain();
        }
    }
    void gao(int n,int l,int r)
    {
        if(l==&&r==n)root->flip^=;
        else if(l==)
        {
            split(root,r,left,right);
            left->flip^=;
            root=Merge(left,right);
        }
        else if(r==n)
        {
            split(root,l-,left,right);
            right->flip^=;
            root=Merge(left,right);
        }
        else
        {
            Node *mid;
            split(root,r,left,right);
            split(left,l-,left,mid);
            mid->flip^=;
            root=Merge(Merge(left,mid),right);
        }
    }
    void print(Node *o)
    {
        o->pushdown();
        if(o->ch[]!=null)print(o->ch[]);
        printf("%d ",o->v);
        if(o->ch[]!=null)print(o->ch[]);
    }
}sp;
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    sp.init(n);
    for(int i=;i<m;i++)
    {
        int l,r;
        scanf("%d%d",&l,&r);
        sp.gao(n,l,r);
    }
    sp.print(sp.root);
    return ;
}
/********************

********************/