Dynamic Rankings【整体二分+树状数组求解动态第K小】

题目链接

---

  求一个动态区间第K小的问题，带修改操作。

  这里就是用到了整体二分，满足条件的放到左边去，不满足的先减去部分，然后再丢进右边去。

  然后，我们维护的是其区间内有几个比它值小的，所以这里就是可以用树状数组前缀和来维护，我们把其"≤mid"的下标的对应的值给丢进树状数组中去，因为有删除和修改的操作，所以要用“+1”和“-1”来分别存进树状数组中去。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 2e5 + 7, _UP = 2e5;
int N, M, a[maxN], tot, ith = 0, ans[maxN], trie[maxN], lsan[maxN], cnt = 0;
inline void update(int x, int val)
{
    while(x < maxN)
    {
        trie[x] += val;
        x += lowbit(x);
    }
}
inline int query(int x)
{
    int sum = 0;
    while(x)
    {
        sum += trie[x];
        x -= lowbit(x);
    }
    return sum;
}
struct node
{
    int op, i, j, k, id;
    node(int a=0, int b=0, int c=0, int d=0, int f=0):op(a), i(b), j(c), k(d) {}
}q[maxN<<1];
vector<node> vt;
void cdq(int l, int r, vector<node> now)
{
    vector<node> LEFT;
    vector<node> RIGHT;
    int len = (int)now.size();;
    if(!len) return;    //可以避免很多多余项的递归
    if(l == r)
    {
        for(int i=0; i<len; i++) if(now[i].op) ans[now[i].op] = l;
        return;
    }
    int mid = HalF, kth = 0;
    for(int i=0; i<len; i++)
    {
        if(!now[i].op)
        {
            if(now[i].i <= mid)
            {
                update(now[i].k, now[i].j);
                LEFT.push_back(now[i]);
            }
            else RIGHT.push_back(now[i]);
        }
        else
        {
            kth = query(now[i].j) - query(now[i].i - 1);
            if(kth >= now[i].k)
            {
                LEFT.push_back(now[i]);
            }
            else
            {
                now[i].k -= kth;
                RIGHT.push_back(now[i]);
            }
        }
    }
    len = (int)LEFT.size();
    for(int i=0; i<len; i++) if(!LEFT[i].op) update(LEFT[i].k, -LEFT[i].j);
    cdq(l, mid, LEFT); cdq(mid + 1, r, RIGHT);
}
int main()
{
    scanf("%d%d", &N, &M);
    for(int i=1; i<=N; i++)
    {
        scanf("%d", &a[i]); lsan[++cnt] = a[i];
//        q[i] = node(0, a[i], 1, i);
        vt.push_back(node(0, a[i], 1, i));  //放入或者取出操作、值的大小是a[i]、是存入操作、在第i位
    }
    tot = N;
    char ch[3];
    for(int i=1, x, y, z; i<=M; i++)
    {
        scanf("%s", ch);
        if(ch[0] == 'Q')
        {
            scanf("%d%d%d", &x, &y, &z);
//            q[++tot] = node(++ith, x, y, z);
            vt.push_back(node(++ith, x, y, z)); //询问操作、[x, y]、第z小
        }
        else
        {
            scanf("%d%d", &x, &y);
//            q[++tot] = node(0, a[x], -1, x);
            vt.push_back(node(0, a[x], -1, x)); //把x位置上的值删除
//            q[++tot] = node(0, y, 1, x);
            vt.push_back(node(0, y, 1, x)); //把x位置上添加上一个新的值y
            a[x] = y; lsan[++cnt] = a[x];
        }
    }
    sort(lsan + 1, lsan + cnt + 1);
    cnt = (int)(unique(lsan + 1, lsan + cnt + 1) - lsan - 1);
    int len = (int)vt.size();
    for(int i=0; i<len; i++)
    {
        if(!vt[i].op) vt[i].i = (int)(lower_bound(lsan + 1, lsan + cnt + 1, vt[i].i) - lsan);
    }
    cdq(0, _UP, vt);
    for(int i=1; i<=ith; i++) printf("%d\n", lsan[ans[i]]);
    return 0;
}