传送门
技不如人,写的权值线段树套线段树在bzoj上无论如何都卡不过空间。
这是一道树套树简单题,感觉没什么好说的。
直接权值线段树套平衡树就行了。
代码:
#include<bits/stdc++.h>
#define N 200000000
using namespace std;
int n,m,t1,t2,t3,t4;
int siz[30000005],son[30000005][2],intot,outtot,val[8000005],ch[8000005][2],rt[8000005],RT;
inline void pushup_in(int p){siz[p]=siz[son[p][0]]+siz[son[p][1]];}
inline void update_in(int&p,int l,int r,int k,int v){
if(!p)p=++intot;
if(l==r){siz[p]+=v;return;}
int mid=l+r>>1;
if(k<=mid)update_in(son[p][0],l,mid,k,v);
else update_in(son[p][1],mid+1,r,k,v);
pushup_in(p);
}
inline int query_in(int p,int l,int r,int ql,int qr){
if(ql>r||qr<l)return 0;
if(ql<=l&&r<=qr)return siz[p];
int mid=l+r>>1;
return query_in(son[p][0],l,mid,ql,qr)+query_in(son[p][1],mid+1,r,ql,qr);
}
inline void update_out(int&p,int l,int r,int outk,int ink,int v){
if(!p)p=++outtot;
update_in(rt[p],1,n,ink,v);
if(l==r)return;
int mid=l+r>>1;
if(outk<=mid)update_out(ch[p][0],l,mid,outk,ink,v);
else update_out(ch[p][1],mid+1,r,outk,ink,v);
}
inline int query_out(int p,int l,int r,int oql,int oqr,int iql,int iqr){
if(oql>r||oqr<l||!p)return 0;
if(oql<=l&&r<=oqr)return query_in(rt[p],1,n,iql,iqr);
int mid=l+r>>1;
return query_out(ch[p][0],l,mid,oql,oqr,iql,iqr)+query_out(ch[p][1],mid+1,r,oql,oqr,iql,iqr);
}
inline int kth(int p,int l,int r,int k,int ql,int qr){
if(l==r)return l;
int tmp=query_in(rt[ch[p][0]],1,n,ql,qr),mid=l+r>>1;
if(tmp>=k)return kth(ch[p][0],l,mid,k,ql,qr);
return kth(ch[p][1],mid+1,r,k-tmp,ql,qr);
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i){
scanf("%d",&val[i]);
update_out(RT,1,N,val[i]+1,i,1);
}
while(m--){
int op,a,b,c;
scanf("%d%d%d",&op,&a,&b);
if(op==3){update_out(RT,1,N,val[a]+1,a,-1),update_out(RT,1,N,1+(val[a]=b),a,1);continue;}
scanf("%d",&c);
if(op==1){printf("%d\n",query_out(RT,1,N,1,c,a,b)+1);}
else if(op==2){printf("%d\n",kth(RT,1,N,c,a,b)-1);}
else if(op==4){
int tmp=query_out(RT,1,N,1,c,a,b);
if(tmp)printf("%d\n",kth(RT,1,N,tmp,a,b)-1);
else puts("-2147483647");
}
else if(op==5){
int tmp=query_out(RT,1,N,1,c+1,a,b)+1;
if((b-a+1)<tmp)puts("2147483647");
else printf("%d\n",kth(RT,1,N,tmp,a,b)-1);
}
}
return 0;
}