zoj 2112 动态区间第k小 （整体二分）

整体二分比较神奇，运用还是不大熟练，再练一些题目再分享关于整体二分的理解吧。先记录一下代码

#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
using namespace std;
#define LL long long
#define sca(x) scanf("%d",&x)
#define lowb(x) (x&(-x))
#define pb(x) push_back(x)
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define pri(x) printf("%d\n",x);
#define N 100005
#define inf 0x3f3f3f3f
const LL mod=1e9+7;


struct node
{
    int x,y,k,id,t;
}q[N],q1[N],q2[N];

int a[N];

struct BIT
{
    int c[N];
    int maxn;
    void init(int n)
    {
        memset(c,0,sizeof(c));
        maxn=n;
    }

    void add(int x,int v)
    {
        for(int i=x;i<=maxn;i+=lowb(i))c[i]+=v;
    }

    int ask(int x)
    {
        int ans=0;
        for(int i=x;i;i-=lowb(i))ans+=c[i];
        return ans;
    }
}bit;
int ou[N];

void solve(int ql,int qr,int l,int r)
{
    if(ql>qr) return ;
    if(l==r)
    {
        rep(i,ql,qr)
        {
            if(q[i].t==2)ou[q[i].id]=l;
        }
        return ;
    }
    int m=(l+r)>>1;

    int L=0,R=0;
    rep(i,ql,qr)
    {
        if(q[i].t==1)
        {
            if(q[i].x<=m)
            {
                bit.add(q[i].id,q[i].y);
                q1[L++]=q[i];
            }
            else q2[R++]=q[i];
        }
        else
        {
            int res=bit.ask(q[i].y)-bit.ask(q[i].x-1);
            if(res>=q[i].k)
            {
                q1[L++]=q[i];
            }
            else q[i].k-=res,q2[R++]=q[i];
        }
    }
    rep(i,0,L-1)if(q1[i].t==1)bit.add(q1[i].id,-q1[i].y);
    int now=ql;
    rep(i,0,L-1)q[now++]=q1[i];
    rep(i,0,R-1)q[now++]=q2[i];

    solve(ql,ql+L-1,l,m);
    solve(ql+L,ql+L+R-1,m+1,r);
}
int main()
{
    int t;
    sca(t);
    while(t--)
    {
        int tot=1;
        int n,m;
        sca(n),sca(m);
        bit.init(n);
        rep(i,1,n)
        {
            sca(a[i]);
            q[tot++]=node{a[i],1,0,i,1};
        }
        char ch=getchar();
        char s[3];
        int x,y,z;
        int qid=1;
        rep(i,1,m)
        {
            scanf("%s",s);
            if(s[0]=='Q')
            {
                scanf("%d%d%d",&x,&y,&z);
                q[tot++]=node{x,y,z,qid++,2};
            }
            else
            {
                scanf("%d%d",&x,&y);
                q[tot++]=node{a[x],-1,0,x,1};
                a[x]=y;
                q[tot++]=node{a[x],1,0,x,1};
            }
        }
        solve(1,tot-1,-inf,inf);
        rep(i,1,qid-1)pri(ou[i]);
    }
}