【bzoj3196】Tyvj 1730 二逼平衡树 树套树

树套树裸题了，但是splay真心常数大呀。

#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<iostream>#include<algorithm>#define maxn 50010#define N 2000010#define inf 1000000000using namespace std;struct yts{int l,r;int root;}t[4*maxn];int n,m,T,tot;int a[maxn],ch[N][2],key[N],fa[N],size[N];int dir(int x){return ch[fa[x]][1]==x;}void update(int x){size[x]=size[ch[x][0]]+size[ch[x][1]]+1;}void rotate(int x){int y,z,a,b,c;y=fa[x];z=fa[y];b=dir(x);a=ch[x][!b];if (z!=0) c=dir(y),ch[z][c]=x;fa[x]=z;fa[y]=x;ch[x][!b]=y;ch[y][b]=a;if (a) fa[a]=y;update(y);update(x);}void splay(int x,int i){while (fa[x]!=i){int y=fa[x],z=fa[y];if (z==i) rotate(x);else{int b=dir(x),c=dir(y);if (b^c){rotate(x);rotate(x);}else{rotate(y);rotate(x);}}}}int find_k(int x,int k){if (size[ch[x][0]]==k-1) return x;if (size[ch[x][0]]>k-1) return find_k(ch[x][0],k);else return find_k(ch[x][1],k-size[ch[x][0]]-1);}int find_Suc(int i,int x){if (!i) return 0;if (key[i]<x) return find_Suc(ch[i][1],x);else{int y=find_Suc(ch[i][0],x);if (y) return y; else return i;}}int find_suc(int i,int x){if (!i) return 0;if (key[i]<=x) return find_suc(ch[i][1],x);else{int y=find_suc(ch[i][0],x);if (y) return y; else return i;}}int find_pre(int i,int x){if (!i) return 0;if (key[i]>=x) return find_pre(ch[i][0],x);else{int y=find_pre(ch[i][1],x);if (y) return y; else return i;}}int query_rank(int &root,int x){int p=find_Suc(root,x);splay(p,0);root=p;return size[ch[p][0]]-1;}int query(int &root,int x){int p=find_suc(root,x);splay(p,0);root=p;return size[ch[p][0]]-1;}void insert(int &root,int x){int p=find_pre(root,x);splay(p,0);int y=find_k(ch[p][1],1);splay(y,p);tot++;key[tot]=x;size[tot]=1;fa[tot]=y;ch[y][0]=tot;update(y);update(p);root=p;}void del(int &root,int x){int p=find_pre(root,x);splay(p,0);int y=find_k(ch[p][1],2);splay(y,p);fa[ch[y][0]]=0;ch[y][0]=0;update(y);update(p);root=p;}void build(int i,int l,int r){t[i].l=l;t[i].r=r;t[i].root=++tot;fa[tot]=0;size[tot]=2;key[tot]=-inf;ch[tot][1]=tot+1;ch[tot][0]=0;tot++;fa[tot]=tot-1;size[tot]=1;key[tot]=inf;ch[tot][0]=ch[tot][1]=0;for (int j=l;j<=r;j++) insert(t[i].root,a[j]);if (l==r) return;int mid=(l+r)/2;build(i*2,l,mid);build(i*2+1,mid+1,r);}void modify(int i,int x,int d){insert(t[i].root,d);del(t[i].root,a[x]);if (t[i].l==t[i].r) return;int mid=(t[i].l+t[i].r)/2;if (x<=mid) modify(i*2,x,d);if (mid<x) modify(i*2+1,x,d);}int query(int i,int l,int r,int x){if (l<=t[i].l && t[i].r<=r) return query(t[i].root,x);int mid=(t[i].l+t[i].r)/2,ans=0;if (l<=mid) ans+=query(i*2,l,r,x);if (mid<r) ans+=query(i*2+1,l,r,x);return ans;}int query_rank(int i,int l,int r,int x){if (l<=t[i].l && t[i].r<=r) return query_rank(t[i].root,x);int mid=(t[i].l+t[i].r)/2,ans=0;if (l<=mid) ans+=query_rank(i*2,l,r,x);if (mid<r) ans+=query_rank(i*2+1,l,r,x);return ans;}int query_pre(int i,int l,int r,int x){if (l<=t[i].l && t[i].r<=r) return key[find_pre(t[i].root,x)];int mid=(t[i].l+t[i].r)/2,ans=0;if (l<=mid) ans=max(ans,query_pre(i*2,l,r,x));if (mid<r) ans=max(ans,query_pre(i*2+1,l,r,x));return ans;}int query_suc(int i,int l,int r,int x){if (l<=t[i].l && t[i].r<=r) return key[find_suc(t[i].root,x)];int mid=(t[i].l+t[i].r)/2,ans=inf;if (l<=mid) ans=min(ans,query_suc(i*2,l,r,x));if (mid<r) ans=min(ans,query_suc(i*2+1,l,r,x));return ans;}int main(){scanf("%d%d",&n,&T);for (int i=1;i<=n;i++) scanf("%d",&a[i]);build(1,1,n);while (T--){int op,x,y,k;scanf("%d%d%d",&op,&x,&y);if (op!=3) scanf("%d",&k);if (op==1) printf("%d\n",query_rank(1,x,y,k)+1);if (op==2){int l=0,r=inf,ans=0;while (l<=r){int mid=(l+r)/2;if (query(1,x,y,mid)>=k) ans=mid,r=mid-1;else l=mid+1;}printf("%d\n",ans);}if (op==3) modify(1,x,y),a[x]=y;if (op==4) printf("%d\n",query_pre(1,x,y,k));if (op==5) printf("%d\n",query_suc(1,x,y,k));}return 0;}