poj 2104 主席树first blood

就不贴传送门了。 搜一下就能知道。

就贴一个卿学姐的视频传送门2333 传送门

贴一下卿学姐代码

#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define N 100007
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)

int n,m,cnt,root[N],a[N],x,y,k;
struct node
{
    int l,r,sum;
}T[N*40];
vector<int>v;
int getid(int x)
{
    return lower_bound(v.begin(),v.end(),x)-v.begin()+1;
}


void update(int l,int r,int &x,int y,int pos)
{
    T[++cnt]=T[y],T[cnt].sum++;x=cnt;
    if(l==r)    return;
    int m=(l+r)/2;
    if(pos<=m)
        update(l,m,T[x].l,T[y].l,pos);
    else
        update(m+1,r,T[x].r,T[y].r,pos);
}
int query(int l,int r,int x,int y,int k)
{
    if(l==r) return l;
    int mid=(l+r)/2;
    int sum=T[T[y].l].sum-T[T[x].l].sum;
    if(sum>=k) return query(l,mid,T[x].l,T[y].l,k);
    else return query(mid+1,r,T[x].r,T[y].r,k-sum);
}
int main()
{
    cin>>n>>m;
    FOR(1,n,i)
    {
        scanf("%d",&a[i]);
        v.push_back(a[i]);
    }
    sort(v.begin(),v.end()),v.erase(unique(v.begin(),v.end()),v.end());
    FOR(1,n,i)
        update(1,n+1,root[i],root[i-1],getid(a[i]));
    FOR(1,m,i)
    {
        scanf("%d%d%d",&x,&y,&k);
        printf("%d\n",v[query(1,n+1,root[x-1],root[y],k)-1]);
    }
}

int a[N], b[N], R[N], T[N], n, tot;
int Ro[N], Lo[N], rn;

struct Q
{
       char o;
       int i, j, k;
}q[N];

struct Tr
{
       int ls, rs, c;
}tr[N*4];

int build(int l, int r)
{
    int mid = (l+r)>>1, root = tot++;
    tr[root].c = 0;
    if (l < r)
    {
          tr[root].ls = build(l, mid);
          tr[root].rs = build(mid+1, r);
    }
    return root;
}

void init(int r)
{
     tot = 0;
     memset(R, 0, sizeof(R));
     T[0] = build(1, r);
}

int lb(int k) {return k&(-k);}

int update(int l, int r, int val, int root, int ad)
{
    int nr = tot++, mid = (l+r)>>1;
    tr[nr].c = tr[root].c+ad;
    if (l == r) return nr;
    if (val <= mid)
    {
       tr[nr].ls = update(l, mid, val, tr[root].ls, ad);
       tr[nr].rs = tr[root].rs;
    }
    else
    {
        tr[nr].rs = update(mid+1, r, val, tr[root].rs, ad);
        tr[nr].ls = tr[root].ls;
    }
    return nr;
}

void add(int i, int k, int r, int ad)
{
    int v = lower_bound(b+1, b+r+1, k)-b;
    while (i <= rn)
    {
          R[i] = update(1, r, v, R[i], ad);
          i += lb(i);
    }
}

void go(int root[], int d)
{
     int i;
     for (i = 1;i <= root[0];i++)
         root[i] = d?tr[root[i]].rs:tr[root[i]].ls;
}

int query(int l, int r, int k, int Rroot, int Lroot)
{
    if (l == r) return l;
    int i, Rls = 0, Lls = 0, mid = (l+r)>>1;
    int sum = tr[tr[Rroot].ls].c-tr[tr[Lroot].ls].c;
    for (i = 1;i <= Ro[0];i++) Rls += tr[tr[Ro[i]].ls].c;
    for (i = 1;i <= Lo[0];i++) Lls += tr[tr[Lo[i]].ls].c;
    if (k <= Rls-Lls+sum)
    {
       go(Ro, 0), go(Lo, 0);
       return query(l, mid, k, tr[Rroot].ls, tr[Lroot].ls);
    }
    else
    {
        go(Ro, 1), go(Lo, 1);
        return query(mid+1, r, k+Lls-Rls-sum, tr[Rroot].rs, tr[Lroot].rs);
    }
}

void cal(int i, int j, int k, int r)
{
     Ro[0] = Lo[0] = 0;
     int ti = j;
     while (ti > 0)
     {
           Ro[++Ro[0]] = R[ti];
           ti -= lb(ti);
     }
     ti = i;
     while (ti > 0)
     {
           Lo[++Lo[0]] = R[ti];
           ti -= lb(ti);
     }
     printf("%d\n", b[query(1, r, k, T[j], T[i])]);
}

int main()
{
    int ca, m, i;
    scanf("%d", &ca);
    while (ca--)
    {
          scanf("%d%d", &n, &m);
          rn = n;
          for (i = 1;i <= n;i++)
          {
              scanf("%d", &a[i]);
              b[i] = a[i];
          }
          for (i = 0;i < m;i++)
          {
              scanf(" %c", &q[i].o);
              if (q[i].o == 'Q') scanf("%d%d%d", &q[i].i, &q[i].j, &q[i].k);
              else scanf("%d%d", &q[i].i, &q[i].j), b[++n] = q[i].j;
          }
          sort(b+1, b+1+n);
          int r = unique(b+1, b+1+n)-b-1;
          init(r);
          for (i = 1;i <= rn;i++) T[i] = update(1, r, lower_bound(b+1, b+1+r, a[i])-b, T[i-1], 1);
          for (i = 0;i < m;i++)
          {
                if (q[i].o == 'Q') cal(q[i].i-1, q[i].j, q[i].k, r);
                else
                {
                    add(q[i].i, a[q[i].i], r, -1), add(q[i].i, q[i].j, r, 1);
                    a[q[i].i] = q[i].j;
                }
          }
    }
}