【COGS 930】找第k小的数

主席树的基础题，也没什么好说的主要再拿出来练一下整体二分

主席树code:

#include<cstdio>
#include<cstring>
#include<algorithm>

#define lson l,mid
#define rson mid+1,r
#define Mid int mid = (l + r) >> 1

using namespace std;
const int N = 100005;
int C[N],C2[N],tt;
struct Node{
    int siz;
    Node *ch[2];
    void init(){
        siz = 0;
        ch[0] = ch[1] = NULL;
    }
    void up(){
        siz = ch[0]->siz + ch[1]->siz;
    }
}T[N * 20];
int qcnt;
struct SegmentTree{
    Node *null,*root[N];
    void init(){
        qcnt = 0;
        null = &T[qcnt ++];
        null->init();
        null->ch[0] = null->ch[1] = null;
    }
    void __build(Node *&y,Node *&x,int l,int r,int c){
        if(x == NULL) x = null;
        y = &T[qcnt ++];
        y->init();
        if(l == r){
            *y = *x;
            y->siz ++;
            return;
        }
        Mid;
        if(c <= C2[mid]){
            __build(y->ch[0],x->ch[0],lson,c);
            y->ch[1] = x->ch[1];
            y->up();
        }
        else{
            __build(y->ch[1],x->ch[1],rson,c);
            y->ch[0] = x->ch[0];
            y->up();
        }
    }
    int __find(Node *x1,Node *x2,int l,int r,int k){
        if(x1 == NULL) x1 = null;
        if(x2 == NULL) x2 = null;
        if(l == r) return C2[l];
        Mid;
        int tt = x2->ch[0]->siz - x1->ch[0]->siz;
        if(tt >= k) return __find(x1->ch[0],x2->ch[0],lson,k);
            else return __find(x1->ch[1],x2->ch[1],rson,k - tt);
    }
    void build(int id){
        __build(root[id],root[id - 1],1,tt,C[id]);
    }
    int find(int l,int r,int k){
        return __find(root[l - 1],root[r],1,tt,k);
    }
}sgt;
int main()
{
    freopen("kth.in","r",stdin);
    freopen("kth.out","w",stdout);
    int n,m;
    int l,r,k;
    scanf("%d%d",&n,&m);
    for(int i = 1 ; i <= n ; i ++) scanf("%d",&C[i]);
    for(int i = 1 ; i <= n ; i ++) C2[i] = C[i];
    sort(C2 + 1,C2 + n + 1);
    tt = unique(C2 + 1,C2 + n + 1) - C2 - 1;
    sgt.init();
    for(int i = 1 ; i <= n ; i ++) sgt.build(i);
    for(int i = 1 ; i <= m ; i ++){
        scanf("%d%d%d",&l,&r,&k);
        printf("%d\n",sgt.find(l,r,k));
    }
    return 0;
}

整体二分code：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

#define lson l,mid
#define rson mid+1,r
#define Mid int mid = (l + r) >> 1

const int N = 100005;
struct Node{
    int v,l;
    bool operator < (const Node &a)const{
        return v < a.v;
    }
}p[N];
int q[N],ql[N],qr[N];
int L[N],R[N],ans[N];
int K[N],cur[N];
int sum[N];
int n;
void add(int x,int c){
    for(int i = x ; i <= n ; i += (i & -i))
        sum[i] += c;
}
int query(int x){
    int res = 0;
    for(int i = x ; i ; i -= (i & -i))
        res += sum[i];
    return res;
}
void solve(int head,int tail,int l,int r){
    if(l == r){
        for(int i = head ; i <= tail ; i ++)
            ans[ q[i] ] = p[l].v;
        return;
    }
    Mid;
    int l1,l2;
    l1 = l2 = 0;
    for(int i = l ; i <= mid ; i ++) add(p[i].l,1);
    for(int i = head ; i <= tail ; i ++){
        int u = q[i];
        int tmp = query(R[u]) - query(L[u] - 1);
        if(cur[u] + tmp >= K[u]) ql[l1 ++] = u;
        else qr[l2 ++] = u,cur[u] += tmp;
    }
    for(int i = l ; i <= mid ; i ++) add(p[i].l,-1);
    for(int i = 0 ; i < l1 ; i ++) q[head + i] = ql[i];
    for(int i = 0 ; i < l2 ; i ++) q[head + l1 + i] = qr[i];
    solve(head,head + l1 - 1,lson);
    solve(head + l1,tail,rson);
}
int main()
{
    freopen("kth.in","r",stdin);
    freopen("kth.out","w",stdout);
    int m;
    scanf("%d%d",&n,&m);
    for(int i = 1 ; i <= n ; i ++){
        scanf("%d",&p[i].v);
        p[i].l = i;
    }
    sort(p + 1,p + n + 1);
    for(int i = 1 ; i <= m ; i ++){
        cur[i] = 0;q[i] = i;
        scanf("%d%d%d",&L[i],&R[i],&K[i]);
    }
    solve(1,m,1,n);
    for(int i = 1 ; i <= m ; i ++)
        printf("%d\n",ans[i]);
    return 0;
}