poj2104 K-th Number (函数式线段树)

K-th Number

求区间第k小，刚学了个模板

代码：

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <stdlib.h>
#include <time.h>
#define lowbit(x) (x&(-x))
#define ll __int64
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
#define ls son[0][rt]
#define rs son[1][rt]
#define new_edge(a,b,c) edge[tot].t = b , edge[tot].v = c , edge[tot].next = head[a] , head[a] = tot ++
using namespace std;

const int maxn = 111111 ;
int L[maxn<<5] , R[maxn<<5] , cnt[maxn<<5] ;
int root[maxn] ;
int num[maxn] , x[maxn] , tail ;

void push_up ( int rt ) {
    cnt[rt] = cnt[L[rt]] + cnt[R[rt]] ;
}

int build ( int l , int r ) {
    cnt[++tail] = 0 ;
    if ( l == r ) return tail ;
    int m = l + r >> 1 , rt = tail ;
    L[rt] = build ( l , m ) ;
    R[rt] = build ( m + 1 , r ) ;
    return rt ;
}

int update ( int fa , int p , int l , int r ) {
    int rt = ++ tail ;
    if ( l == r ) { cnt[tail] = cnt[fa] + 1 ; return tail ; }
    int m = l + r >> 1 ;
    L[rt] = L[fa] , R[rt] = R[fa] ;
    if ( p <= m ) L[rt] = update ( L[fa] , p , l , m ) ;
    else R[rt] = update ( R[fa] , p , m + 1 , r ) ;
    push_up ( rt ) ;
    return rt ;
}

int query ( int u , int v , int l , int r , int k ) {
    if ( l == r ) return l ;
    int m = l + r >> 1 ;
    int num = cnt[L[v]] - cnt[L[u]] ;
    if ( num >= k ) return query ( L[u] , L[v] , l , m , k ) ;
    else return query ( R[u] , R[v] , m + 1 , r , k - num ) ;
}

int main() {
    int cas ;
    int n , i , j , k , m ;
    while ( scanf ( "%d%d" , &n , &m ) != EOF ) {
        for ( i = 1 ; i <= n ; i ++ ) scanf ( "%d" , &num[i] ) , x[i] = num[i] ;
        sort ( x + 1 , x + n + 1 ) ;
        int tot = unique ( x + 1 , x + n + 1 ) - x - 1 ;
        for ( i = 1 ; i <= n ; i ++ ) num[i] = lower_bound ( x + 1 , x + tot + 1 , num[i] ) - x ;
        tail = 0 ;
        root[0] = build ( 1 , tot ) ;
        for ( i = 1 ; i <= n ; i ++ ) root[i] = update ( root[i-1] , num[i] , 1 , tot ) ;
        while ( m -- ) {
            int l , r ;
            scanf ( "%d%d%d" , &l , &r , &k ) ;
            k = query ( root[l-1] , root[r] , 1 , tot , k ) ;
            printf ( "%d\n" , x[k] ) ;
        }
    }
    return 0;
}