[数据结构]可持久化权值线段树

https://www.luogu.com.cn/problem/P3834
解决静态区间第k小的问题。

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int tot, n, m;
int sum[maxn << 5], rt[maxn], ls[maxn << 5], rs[maxn << 5];
int a[maxn], ind[maxn], len;
inline int getid(const int &val)
{
   
    return lower_bound(ind + 1, ind + len + 1, val) - ind;
}
int build(int l, int r)
{
   
    int root = ++tot;
    if (l == r) return root;
    int mid = l + r >> 1;
    ls[root] = build(l, mid);
    rs[root] = build(mid + 1, r);
    return root;
}
int update(int k, int l, int r, int root)
{
   
    int dir = ++tot;
    ls[dir] = ls[root], rs[dir] = rs[root], sum[dir] = sum[root] + 1;
    if (l == r) return dir;
    int mid = l + r >> 1;