[ZOJ2112][可持久化線段樹（主席樹）][樹狀數組]Dynamic Rankings[好題]

題意：

    給出一個序列，求區間第k小。要求支持單點修改。

題解：

不談修改的時候，地球人都會做。
主要考慮如何維護修改。如果直接在建好的線段樹上修改，每次需要新建O(n) 棵線段樹，顯然吃不消。
請諸君一定要有一個思想，所謂“函數式線段樹”，本質是“化‘樹’爲‘數’”，讓“線段樹”這一複雜的結構變得像“數字”一樣可以加加減減。爲什麼區間第k大要用主席樹做？因爲我們要求區間內小於某一個數的數字個數。這顯然是可加的。我們不如就類比做區間求和。帶修改的區間求和如何做？樹狀數組可做。那樹狀數組每個節點維護的東西變成主席樹，就能維護題目中的修改了。

（不要隨便看代碼。不要隨便看代碼。不要隨便看代碼。重要的事情說三遍。）

指針版：

#ifdef _MSC_VER
# include "stdafx.h"
# pragma warning(disable:4996)
#endif

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

//Global Variables & Definitions
#define lowbit(x) ((x) & (-(x)))

int X, M, N;

#define MAXN 50050
#define MAXM 10010
#define MAXT (MAXN + MAXM)

int A[MAXN];
//End Global Variables & Definitions

//Discretization
int w[MAXT];
int wcnt;

void Discre(int cnt) {
    sort(w + 1, w + cnt + 1);
    wcnt = unique(w + 1, w + cnt + 1) - w - 1;
}

int getid(int ww) {
    return lower_bound(w + 1, w + wcnt + 1, ww) - w;
}
//End Discretization

//Chairman Tree
#define DEFINE_MID int mid = (l + r) >> 1
#define lson (u -> lc)
#define rson (u -> rc)

namespace CMT {
    struct node {
        node *lc, *rc;
        int sum;
    } T[1750250];

    int tcnt = 0;
    inline void Init() {
        tcnt = 0;
    }

    inline node* newnode() {
        //return new node();
        return &T[tcnt++];
    }

    inline node* Copy(node *u) {
        node *temp = newnode();
        *temp = *u;
        return temp;
    }

    inline void PushUp(node *u) {
        u->sum = lson->sum + rson->sum;
    }

    void Build(node *u, int l, int r) {
        u->sum = 0; u->lc = u->rc = NULL;

        if (l == r) return;
        DEFINE_MID;

        lson = newnode();
        Build(lson, l, mid);
        rson = newnode();
        Build(rson, mid + 1, r);
    }

    void Insert(node *u, int l, int r, int p, int v = 1) {
        if (l == r) { u->sum += v; return; }

        DEFINE_MID;
        if (p <= mid) {
            lson = Copy(lson);
            Insert(lson, l, mid, p, v);
        }
        else {
            rson = Copy(rson);
            Insert(rson, mid + 1, r, p, v);
        }

        PushUp(u);
    }

    int Query(node *u, int l, int r, int p) {
        if (p >= r) return u->sum;

        DEFINE_MID;

        if (p == mid) return lson->sum;
        else if (p < mid) return Query(lson, l, mid, p);
        else return lson->sum + Query(rson, mid + 1, r, p);
    }
}

using CMT::node;

node* root[MAXN];
//End Chairman Tree

//Fenwick Tree
node* ftr[MAXN];

void Modify(int x, int p, int v) {
    while (x <= N) {
        ftr[x] = CMT::Copy(ftr[x]);
        CMT::Insert(ftr[x], 1, wcnt, p, v);
        x += lowbit(x);
    }
}

int sum(int x, int p) {
    int temp = 0;
    while (x) {
        temp += CMT::Query(ftr[x], 1, wcnt, p);
        x -= lowbit(x);
    }

    return temp;
}
//End Fenwick Tree

//Main Structure
inline int getans(int l, int r, int v) {
    int ansa = CMT::Query(root[r], 1, wcnt, v) - CMT::Query(root[l], 1, wcnt, v);
    ansa += sum(r, v);
    ansa -= sum(l, v);
    return ansa;
}

int Query(int l, int r, int k) {
    int L = 1, R = wcnt;

    while (L < R) {
        int mid = (L + R) >> 1;
        int tans = getans(l - 1, r, mid);

        if (tans >= k) R = mid;
        else L = mid + 1;
    }

    return w[L];
}

char Act[MAXM];
int I[MAXM], J[MAXM], K[MAXM];

void ir() {
    //Read
    scanf("%d%d", &N, &M);

    for (int i = 1; i <= N; ++i) {
        scanf("%d", &A[i]);
        w[i] = A[i];
    }

    wcnt = N;
    char temp[20]; int ii, jj, kk;
    for (int i = 0; i < M; ++i) {
        scanf("%s%d", temp, &ii);

        if ((Act[i] = temp[0]) == 'Q') {
            scanf("%d%d", &jj, &kk);

            I[i] = ii;
            J[i] = jj;
            K[i] = kk;
        }
        else {
            scanf("%d", &jj);

            I[i] = ii;
            w[++wcnt] = J[i] = jj;
        }
    }

    Discre(wcnt);

    //Build
    CMT::Init();
    root[0] = CMT::newnode();
    CMT::Build(root[0], 1, wcnt);
    for (int i = 1; i <= N; ++i) {
        root[i] = CMT::Copy(root[i - 1]);
        CMT::Insert(root[i], 1, wcnt, getid(A[i]));
    }

    for (int i = 1; i <= N; ++i) ftr[i] = root[0];
}

void solve() {
    ir();

    for (int i = 0; i < M; ++i) {
        if (Act[i] == 'Q') {
            printf("%d\n", Query(I[i], J[i], K[i]));
        }
        else {
            Modify(I[i], getid(A[I[i]]), -1);
            Modify(I[i], getid(A[I[i]] = J[i]), 1);
        }
    }
}

inline void g_ir() {
    scanf("%d", &X);
}

int main() {
    g_ir();

    while (X--) solve();
    return 0;
}

數組版：

#ifdef _MSC_VER
# include "stdafx.h"
# pragma warning(disable:4996)
#endif

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

//Global Variables & Definitions
#define lowbit(x) ((x) & (-(x)))

int X, M, N;

#define MAXN 50050
#define MAXM 10010
#define MAXT (MAXN + MAXM)

int A[MAXN];
//End Global Variables & Definitions

//Discretization
int w[MAXT];
int wcnt;

void Discre(int cnt) {
    sort(w + 1, w + cnt + 1);
    wcnt = unique(w + 1, w + cnt + 1) - w - 1;
}

int getid(int ww) {
    return lower_bound(w + 1, w + wcnt + 1, ww) - w;
}
//End Discretization

//Chairman Tree
#define DEFINE_MID int mid = (l + r) >> 1
#define lson T[u].lc
#define rson T[u].rc

namespace CMT {
    struct node {
        int lc, rc;
        int sum;
    } T[2500250];

    int tcnt = 0;
    inline void Init() {
        tcnt = 0;
    }

    inline int newnode() {
        return tcnt++;
    }

    inline int Copy(int u) {
        int temp = newnode();
        T[temp] = T[u];
        return temp;
    }

    inline void PushUp(int u) {
        T[u].sum = T[lson].sum + T[rson].sum;
    }

    void Build(int u, int l, int r) {
        T[u].sum = 0; T[u].lc = T[u].rc = 0;

        if (l == r) return;
        DEFINE_MID;

        lson = newnode();
        Build(lson, l, mid);
        rson = newnode();
        Build(rson, mid + 1, r);
    }

    void Insert(int u, int l, int r, int p, int v = 1) {
        if (l == r) { T[u].sum += v; return; }

        DEFINE_MID;
        if (p <= mid) {
            lson = Copy(lson);
            Insert(lson, l, mid, p, v);
        }
        else {
            rson = Copy(rson);
            Insert(rson, mid + 1, r, p, v);
        }

        PushUp(u);
    }

    int Query(int u, int l, int r, int p) {
        if (p >= r) return T[u].sum;

        DEFINE_MID;

        if (p == mid) return T[lson].sum;
        else if (p < mid) return Query(lson, l, mid, p);
        else return T[lson].sum + Query(rson, mid + 1, r, p);
    }
}

using CMT::node;

int root[MAXN];
//End Chairman Tree

//Fenwick Tree
int ftr[MAXN];

void Modify(int x, int p, int v) {
    while (x <= N) {
        ftr[x] = CMT::Copy(ftr[x]);
        CMT::Insert(ftr[x], 1, wcnt, p, v);
        x += lowbit(x);
    }
}

int sum(int x, int p) {
    int temp = 0;
    while (x) {
        temp += CMT::Query(ftr[x], 1, wcnt, p);
        x -= lowbit(x);
    }

    return temp;
}
//End Fenwick Tree

//Main Structure
inline int getans(int l, int r, int v) {
    int ansa = CMT::Query(root[r], 1, wcnt, v) - CMT::Query(root[l], 1, wcnt, v);
    ansa += sum(r, v);
    ansa -= sum(l, v);
    return ansa;
}

int Query(int l, int r, int k) {
    int L = 1, R = wcnt;

    while (L < R) {
        int mid = (L + R) >> 1;
        int tans = getans(l - 1, r, mid);

        if (tans >= k) R = mid;
        else L = mid + 1;
    }

    return w[L];
}

char Act[MAXM];
int I[MAXM], J[MAXM], K[MAXM];

void ir() {
    //Read
    scanf("%d%d", &N, &M);

    for (int i = 1; i <= N; ++i) {
        scanf("%d", &A[i]);
        w[i] = A[i];
    }

    wcnt = N;
    char temp[20]; int ii, jj, kk;
    for (int i = 0; i < M; ++i) {
        scanf("%s%d", temp, &ii);

        if ((Act[i] = temp[0]) == 'Q') {
            scanf("%d%d", &jj, &kk);

            I[i] = ii;
            J[i] = jj;
            K[i] = kk;
        }
        else {
            scanf("%d", &jj);

            I[i] = ii;
            w[++wcnt] = J[i] = jj;
        }
    }

    Discre(wcnt);

    //Build
    CMT::Init();
    root[0] = CMT::newnode();
    CMT::Build(root[0], 1, wcnt);
    for (int i = 1; i <= N; ++i) {
        root[i] = CMT::Copy(root[i - 1]);
        CMT::Insert(root[i], 1, wcnt, getid(A[i]));
    }

    for (int i = 1; i <= N; ++i) ftr[i] = root[0];
}

void solve() {
    ir();

    for (int i = 0; i < M; ++i) {
        if (Act[i] == 'Q') {
            printf("%d\n", Query(I[i], J[i], K[i]));
        }
        else {
            Modify(I[i], getid(A[I[i]]), -1);
            Modify(I[i], getid(A[I[i]] = J[i]), 1);
        }
    }
}

inline void g_ir() {
    scanf("%d", &X);
}

int main() {
    g_ir();

    while (X--) solve();
    return 0;
}

（當你看到這裏我纔會告訴你ZOJ上指針版沒有WA但是會MLE）