树套树——BZOJ3196/Luogu3380 二逼平衡树

http://www.lydsy.com/JudgeOnline/problem.php?id=3196
https://www.luogu.org/problem/show?pid=3380
tyvj原题：传送门
这么多乱七八糟的操作，交给平衡树好了
再加上区间，外面套个线段树好了
不过呢，可能我写得太渣了吧，splay一直TLE
没办法，换了个非旋式Treap搞搞掉算了。。。

#include<bits/stdc++.h>
using namespace std;
const int oo=2147483647;
struct tree{
    int l,r,v,w,s,nod;
}t[2000001];
int a[200001],root[200001];
int sum=0,n,m,ans;
inline void update(int x){t[x].s=t[t[x].l].s+t[t[x].r].s+t[x].w;}
inline void rturn(int &x){
    int tt=t[x].l;t[x].l=t[tt].r;t[tt].r=x;
    t[tt].s=t[x].s;update(x);x=tt;
}
inline void lturn(int &x){
    int tt=t[x].r;t[x].r=t[tt].l;t[tt].l=x;
    t[tt].s=t[x].s;update(x);x=tt;
}
inline void sinsert(int &x,int y){
    if(x==0){
        sum++;x=sum;
        t[x].s=t[x].w=1;t[x].v=y;t[x].nod=rand();return;
    }
    t[x].s++;if(t[x].v==y)t[x].w++;
    else if(y>t[x].v){
        sinsert(t[x].r,y);
        if(t[t[x].r].nod<t[x].nod)lturn(x);
    }else{
        sinsert(t[x].l,y);
        if(t[t[x].l].nod<t[x].nod)rturn(x);
    }
}
inline void sshan(int &x,int y){
    if(x==0)return;
    if(t[x].v==y){
        if(t[x].w>1){t[x].w--;t[x].s--;return;}
        if(t[x].l*t[x].r==0)x=t[x].l+t[x].r;
        else if(t[t[x].l].nod<t[t[x].r].nod)rturn(x),sshan(x,y);
        else lturn(x),sshan(x,y);
    }else if(y>t[x].v)t[x].s--,sshan(t[x].r,y);
    else t[x].s--,sshan(t[x].l,y);
}
inline void srank(int x,int y){
    if(x==0)return;
    if(t[x].v==y){ans+=t[t[x].l].s;return;}
    else if(y>t[x].v){ans+=t[t[x].l].s+t[x].w;srank(t[x].r,y);}
    else srank(t[x].l,y);
}
inline void spre(int x,int y){
    if(x==0)return;
    if(t[x].v<y){ans=max(ans,t[x].v);spre(t[x].r,y);}
    else spre(t[x].l,y);
}
inline void ssucc(int x,int y){
    if(x==0)return;
    if(t[x].v>y){ans=min(ans,t[x].v);ssucc(t[x].l,y);}
    else ssucc(t[x].r,y);
}
inline void winsert(int l,int r,int x,int v,int nod){
    sinsert(root[nod],v);
    if(l==r)return;
    int mid=(l+r)>>1;
    if(x<=mid)winsert(l,mid,x,v,nod*2);
    else winsert(mid+1,r,x,v,nod*2+1);
}
inline void wrank(int l,int r,int x,int y,int k,int nod){
    if(l==x&&r==y){srank(root[nod],k);return;}
    int mid=(l+r)>>1;
    if(mid>=y)wrank(l,mid,x,y,k,nod*2);
    else if(x>mid)wrank(mid+1,r,x,y,k,nod*2+1);
    else{
        wrank(l,mid,x,mid,k,nod*2);
        wrank(mid+1,r,mid+1,y,k,nod*2+1);
    }
}
inline int wnum(int x,int y,int k){
    int l=0,r=oo,cnt;
    while(l<=r){
        ans=1;int mid=(l+r)>>1;
        wrank(1,n,x,y,mid,1);
        if(ans<=k)cnt=mid,l=mid+1;
        else r=mid-1;
    }
    return cnt;
}
inline void whuan(int l,int r,int x,int y,int v,int nod){
    sshan(root[nod],y);
    sinsert(root[nod],v);
    if(l==r)return;
    int mid=(l+r)>>1;
    if(x<=mid)whuan(l,mid,x,y,v,nod*2);
    else whuan(mid+1,r,x,y,v,nod*2+1);
}
inline void wpre(int l,int r,int x,int y,int k,int nod){
    if(l==x&&r==y){spre(root[nod],k);return;}
    int mid=(l+r)>>1;
    if(mid>=y)wpre(l,mid,x,y,k,nod*2);
    else if(x>mid)wpre(mid+1,r,x,y,k,nod*2+1);
    else{
        wpre(l,mid,x,mid,k,nod*2);
        wpre(mid+1,r,mid+1,y,k,nod*2+1);
    }
}
inline void wsucc(int l,int r,int x,int y,int k,int nod){
    if(l==x&&r==y){ssucc(root[nod],k);return;}
    int mid=(l+r)>>1;
    if(mid>=y)wsucc(l,mid,x,y,k,nod*2);
    else if(x>mid)wsucc(mid+1,r,x,y,k,nod*2+1);
    else{
        wsucc(l,mid,x,mid,k,nod*2);
        wsucc(mid+1,r,mid+1,y,k,nod*2+1);
    }
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        winsert(1,n,i,a[i],1);
    }
    int x,y,z,k;
    for(int i=1;i<=m;i++){
        scanf("%d%d%d",&z,&x,&y);
        if(z==1)scanf("%d",&k),ans=1,wrank(1,n,x,y,k,1),printf("%d\n",ans);
        else if(z==2)scanf("%d",&k),printf("%d\n",wnum(x,y,k));
        else if(z==3)whuan(1,n,x,a[x],y,1),a[x]=y;
        else if(z==4)scanf("%d",&k),ans=-oo,wpre(1,n,x,y,k,1),printf("%d\n",ans);
        else if(z==5)scanf("%d",&k),ans=oo,wsucc(1,n,x,y,k,1),printf("%d\n",ans);
    }
    return 0;
}

贴一下我的splay代码吧，欢迎大佬帮我找错，谢谢辣>_<！

#include<bits/stdc++.h>
using namespace std;
const int oo=2147483647;
int t[2000001][2],fa[2000001],v[2000001],val[2000001],s[2000001];
int a[200001],root[200001];
int tt=0,n,m,ans;
inline void pushup(int x){s[x]=s[t[x][0]]+s[t[x][1]]+v[x];}
inline void turn(int x,int &p){
    int y=fa[x],z=fa[y],l,r;
    if(t[y][0]==x)l=0;else l=1;
    r=l^1;
    if(y==p)p=x;
    else if(t[z][0]==y)t[z][0]=x;
    else t[z][1]=x;
    fa[x]=z;fa[y]=x;fa[t[x][r]]=y;
    t[y][l]=t[x][r];t[x][r]=y;
    pushup(y);pushup(x);
}
inline void splay(int x,int &p){
    int y,z;while(x!=p){
        y=fa[x];z=fa[y];
        if(y!=p){
            if((t[y][0]==x)^(t[z][0]==y))turn(x,p);
            else turn(y,p);
        }
        turn(x,p);
    }
}
inline void sinsert(int& rt,int k){
    if(!rt){
        tt++;rt=tt;
        val[tt]=k;s[tt]=v[tt]=1;
        return;
    }
    int p=rt,z;
    while(p){
        z=p;s[p]++;
        if(k<val[p])p=t[p][0];
        else if(k>val[p])p=t[p][1];
        else{v[p]++;pushup(p);splay(p,rt);return;}
    }
    if(val[z]>k)t[z][0]=++tt;
    else t[z][1]=++tt;
    val[tt]=k;s[tt]=v[tt]=1;fa[tt]=z;
    splay(tt,rt);
}
inline void sshan(int& rt,int y){
    int x=rt;
    while(val[x]!=y){
        if(val[x]>y)x=t[x][0];
        else x=t[x][1];
    }
    splay(x,rt);
    if(v[x]>1){v[x]--;pushup(x);return;}
    if(t[x][0]*t[x][1]==0)rt=t[x][0]+t[x][1];
    else{
        int y=t[x][1];
        while(t[y][0])y=t[y][0];
        t[y][0]=t[x][0];fa[t[x][0]]=y;s[t[y][0]]=s[t[x][0]];v[t[y][0]]=v[t[x][0]];
        pushup(y);
        rt=t[x][1];
    }
    fa[rt]=0;
}
inline void srank(int x,int y){
    if(x==0)return;
    if(val[x]==y){ans+=s[t[x][0]];return;}
    else if(y>val[x]){ans+=s[t[x][0]]+v[x];srank(t[x][1],y);}
    else srank(t[x][0],y);
}
inline void spre(int x,int y){
    if(x==0)return;
    if(val[x]<y){ans=max(ans,val[x]);spre(t[x][1],y);}
    else spre(t[x][0],y);
}
inline void ssucc(int x,int y){
    if(x==0)return;
    if(val[x]>y){ans=min(ans,val[x]);ssucc(t[x][0],y);}
    else ssucc(t[x][1],y);
}
inline void winsert(int l,int r,int x,int v,int nod){
    sinsert(root[nod],v);
    if(l==r)return;
    int mid=(l+r)>>1;
    if(x<=mid)winsert(l,mid,x,v,nod*2);
    else winsert(mid+1,r,x,v,nod*2+1);
}
inline void wrank(int l,int r,int x,int y,int k,int nod){
    if(l==x&&r==y){srank(root[nod],k);return;}
    int mid=(l+r)>>1;
    if(mid>=y)wrank(l,mid,x,y,k,nod*2);
    else if(x>mid)wrank(mid+1,r,x,y,k,nod*2+1);
    else{
        wrank(l,mid,x,mid,k,nod*2);
        wrank(mid+1,r,mid+1,y,k,nod*2+1);
    }
}
inline void wnum(int x,int y,int k){
    int l=0,r=oo,cnt;
    while(l<=r){
        ans=1;int mid=(l+r)>>1;
        wrank(1,n,x,y,mid,1);
        if(ans<=k)cnt=mid,l=mid+1;
        else r=mid-1;
    }
    return cnt;
}
inline void whuan(int l,int r,int x,int y,int v,int nod){
    sshan(root[nod],y);
    sinsert(root[nod],v);
    if(l==r)return;
    int mid=(l+r)>>1;
    if(x<=mid)whuan(l,mid,x,y,v,nod*2);
    else whuan(mid+1,r,x,y,v,nod*2+1);
}
inline void wpre(int l,int r,int x,int y,int k,int nod){
    if(l==x&&r==y){spre(root[nod],k);return;}
    int mid=(l+r)>>1;
    if(mid>=y)wpre(l,mid,x,y,k,nod*2);
    else if(x>mid)wpre(mid+1,r,x,y,k,nod*2+1);
    else{
        wpre(l,mid,x,mid,k,nod*2);
        wpre(mid+1,r,mid+1,y,k,nod*2+1);
    }
}
inline void wsucc(int l,int r,int x,int y,int k,int nod){
    if(l==x&&r==y){ssucc(root[nod],k);return;}
    int mid=(l+r)>>1;
    if(mid>=y)wsucc(l,mid,x,y,k,nod*2);
    else if(x>mid)wsucc(mid+1,r,x,y,k,nod*2+1);
    else{
        wsucc(l,mid,x,mid,k,nod*2);
        wsucc(mid+1,r,mid+1,y,k,nod*2+1);
    }
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        winsert(1,n,i,a[i],1);
    }
    int x,y,z,k;
    for(int i=1;i<=m;i++){
        scanf("%d%d%d",&z,&x,&y);
        if(z==1)scanf("%d",&k),ans=1,wrank(1,n,x,y,k,1),printf("%d\n",ans);
        else if(z==2)scanf("%d",&k),printf("%d\n",wnum(x,y,k));
        else if(z==3)whuan(1,n,x,a[x],y,1),a[x]=y;
        else if(z==4)scanf("%d",&k),ans=-oo,wpre(1,n,x,y,k,1),printf("%d\n",ans);
        else if(z==5)scanf("%d",&k),ans=oo,wsucc(1,n,x,y,k,1),printf("%d\n",ans);
    }
    return 0;
}