[带修莫队 权值分块] BZOJ 3196 Tyvj 1730 二逼平衡树

这题有很多算法，我已知：

分块+二分：O(n*sqrt(n*log(n))

函数式权值分块：O(n*sqrt(n))

带修莫队+权值分块：O(n^5/3)

树套树 

我打的莫队+分块，跑的死慢

#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<cstring>using namespace std;inline char nc(){static char buf[100000],*p1=buf,*p2=buf;if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }return *p1++;}inline void read(int &x){char c=nc(),b=1;for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;}namespace Block{int block,n,tot;int a[150005],pos[150005];int sum[1005];inline void init(int _n){n=_n;block=pow(n,2.0/3.0)+1;for (int i=1;i<=n;i++) pos[i]=(i-1)/block+1;tot=pos[n];}inline void add(int x,int r){a[x]+=r; sum[pos[x]]+=r;}inline int kth(int k){int i,j;for (i=1;i<=tot && k>sum[i];i++)k-=sum[i];for (j=(i-1)*block+1;j<=min(i*block,n) && k>a[j];j++)k-=a[j];return j;}inline int rank(int k){int cnt=0;for (int i=1;i<=pos[k]-1;i++)cnt+=sum[i];for (int i=(pos[k]-1)*block+1;i<k;i++)cnt+=a[i];return cnt+1;}inline int nxt(int k){return kth(rank(k)+a[k]);}inline int pre(int k){return kth(rank(k)-1);}}struct Change{int pos,x,y;}C[50005];int clk;struct Query{int f;int l,r,x;int pos,idx,time;bool operator < (const Query &B) const{return pos==B.pos?r<B.r:pos<B.pos;}}Q[50005];int tot;int n,m,B;int a[50005],_a[50005];int sx[150005],icnt;int ans[100005];inline int Bin(int x){return lower_bound(sx+1,sx+icnt+1,x)-sx;}inline void deal(int id){if (Q[id].f==1)ans[Q[id].idx]=Block::rank(Q[id].x);else if (Q[id].f==2)ans[Q[id].idx]=sx[Block::kth(Q[id].x)];else if (Q[id].f==4)ans[Q[id].idx]=sx[Block::pre(Q[id].x)];else if (Q[id].f==5)ans[Q[id].idx]=sx[Block::nxt(Q[id].x)];}inline void Solve(){for (int i=1;i<=n;i++)_a[i]=Bin(a[i]);int l=1,r=0;for (int i=1;i<=tot;i++){for (int j=Q[i-1].time+1;j<=Q[i].time;j++){_a[C[j].pos]=C[j].y; if (C[j].pos>=l && C[j].pos<=r)Block::add(C[j].x,-1),Block::add(C[j].y,1);}for (int j=Q[i-1].time;j>Q[i].time;j--){_a[C[j].pos]=C[j].x; if (C[j].pos>=l && C[j].pos<=r)Block::add(C[j].y,-1),Block::add(C[j].x,1);}for (;l<Q[i].l;l++) Block::add(_a[l],-1);for (;l>Q[i].l;l--) Block::add(_a[l-1],1);for (;r<Q[i].r;r++)Block::add(_a[r+1],1);for (;r>Q[i].r;r--)Block::add(_a[r],-1);deal(i);}}int main(){int order;freopen("t.in","r",stdin);freopen("t.out","w",stdout);read(n); read(m);B=pow(n,2.0/3.0)+1;for (int i=1;i<=n;i++)read(a[i]),sx[++icnt]=a[i],_a[i]=a[i];for (int i=1;i<=m;i++){read(order);if (order==1){Q[++tot].f=order; Q[tot].idx=tot; Q[tot].time=clk;read(Q[tot].l); read(Q[tot].r); read(Q[tot].x);sx[++icnt]=Q[tot].x;}else if (order==2){Q[++tot].f=order; Q[tot].idx=tot; Q[tot].time=clk;read(Q[tot].l); read(Q[tot].r); read(Q[tot].x);}else if (order==3){++clk;read(C[clk].pos); read(C[clk].y); C[clk].x=_a[C[clk].pos]; _a[C[clk].pos]=C[clk].y;sx[++icnt]=C[clk].y;}else if (order==4){Q[++tot].f=order; Q[tot].idx=tot; Q[tot].time=clk;read(Q[tot].l); read(Q[tot].r); read(Q[tot].x);sx[++icnt]=Q[tot].x;}else if (order==5){Q[++tot].f=order; Q[tot].idx=tot; Q[tot].time=clk;read(Q[tot].l); read(Q[tot].r); read(Q[tot].x);sx[++icnt]=Q[tot].x;}}sort(sx+1,sx+icnt+1);icnt=unique(sx+1,sx+icnt+1)-sx-1;Block::init(icnt);for (int i=1;i<=tot;i++){if (Q[i].f!=2)Q[i].x=Bin(Q[i].x);Q[i].pos=(Q[i].l-1)/B+1;}sort(Q+1,Q+tot+1);for (int i=1;i<=clk;i++)C[i].x=Bin(C[i].x),C[i].y=Bin(C[i].y);Solve();for (int i=1;i<=tot;i++)printf("%d\n",ans[i]);return 0;}