ZOJ2112 Dynamic Rankings

整体二分

#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 1e5 + 5;
char s[5];
int inf = 1e9, ans[maxn], c[maxn], n, m, tot, a[maxn];
struct node{ int op, x, y, z, id; } q[maxn*2], lq[maxn*2], rq[maxn*2];
int lowbit(int x){ return x&(-x); }
void update(int k,int x)
{
    for(int i = k; i <= n; i += lowbit(i)) c[i] += x;
}
int query(int k)
{
    int res = 0;
    for(int i = k; i; i -= lowbit(i)) res += c[i];
    return res;
}
void solve(int l,int r,int L,int R)
{
    if(L > R) return ;
    if(l == r){
        for(int i = L; i <= R; i++){
            if(q[i].op == 3) ans[q[i].id] = l;
        }
        return ;
    }
    int mid = (l+r)>>1, cnt1 = 0, cnt2 = 0;
    for(int i = L; i <= R; i++){
        if(q[i].op == 1){
            if(q[i].y <= mid) update(q[i].x,1), lq[++cnt1] = q[i];
            else rq[++cnt2] = q[i];
        }
        else if(q[i].op == 2){
            if(q[i].y <= mid) update(q[i].x,-1), lq[++cnt1] = q[i];
            else rq[++cnt2] = q[i];
        }
        else{
            int tmp = query(q[i].y)-query(q[i].x-1);
            if(tmp >= q[i].z) lq[++cnt1] = q[i];
            else q[i].z -= tmp, rq[++cnt2] = q[i];
        }
    }
    for(int i = R; i >= L; i--){
        if(q[i].op == 1 && q[i].y <= mid) update(q[i].x,-1);
        else if(q[i].op == 2 && q[i].y <= mid) update(q[i].x,1);
    }
    for(int i = 1; i <= cnt1; i++) q[L+i-1] = lq[i];
    for(int i = 1; i <= cnt2; i++) q[L+cnt1+i-1] = rq[i];
    solve(l,mid,L,L+cnt1-1);
    solve(mid+1,r,L+cnt1,R);
}
int main()
{
    int ansid, t;
    scanf("%d",&t);
    while(t--){
        ansid = 0; tot = 0;
        memset(c,0,sizeof(c));
        scanf("%d%d",&n,&m);
        for(int i = 1; i <= n; i++){
            scanf("%d",&a[i]);
            q[++tot].op = 1; q[tot].x = i, q[tot].y = a[i];
        }
        for(int i = 1,l,r,k; i <= m; i++){
            scanf("%s",s);
            if(s[0] == 'Q'){
                scanf("%d%d%d",&l,&r,&k);
                q[++tot].op = 3; q[tot].x = l; q[tot].y = r; q[tot].z = k;
                q[tot].id = ++ansid;
            }
            else{
                scanf("%d%d",&l,&r);
                q[++tot].op = 2; q[tot].x = l; q[tot].y = a[l];
                q[++tot].op = 1; q[tot].x = l; q[tot].y = r;
                a[l] = r;
            }
        }
        solve(-inf,inf,1,tot);
        for(int i = 1; i <= ansid; i++) printf("%d\n",ans[i]);
    }
    return 0;
}