主席树代码模板
本篇博客仅提供代码模板,具体的算法思想,等本蒟蒻深度理解主席树之后补上。
题目描述
给定 n 个整数构成的序列 a,将对于指定的闭区间 [l, r] 查询其区间内的第 k 小值。
代码模板
#include<iostream>
#include<time.h>
#include<cstdio>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstring>
#include<map>
#include<algorithm>
#include<string>
#include<set>
#include<sstream>
#include<iomanip>
#define INF 0x3f3f3f3f
using namespace std;
const int mod = 10007;
typedef long long ll;
const int N = 4000010;
int n, m;
vector<int> nums;
struct node
{
int l, r;
int val;
}tr[N];
int root[N];
int a[N];
int idx;
int build(int l,int r)
{
int p = ++idx;
if(l == r) return p;
int mid = l + r >> 1;
tr[p].l = build(l, mid);
tr[p].r = build(mid + 1, r);
return p;
}
int add(int q, int l, int r, int x)
{
int p = ++idx;
tr[p] = tr[q];
if(l == r)
{
tr[p].val ++;
return p;
}
int mid = l + r >> 1;
if(x <= mid) tr[p].l = add(tr[q].l, l, mid, x);
else tr[p].r = add(tr[q].r, mid + 1, r, x);
tr[p].val = tr[tr[p].l].val + tr[tr[p].r].val;
return p;
}
int query(int q, int p, int l, int r, int x)
{
if(l == r) return l;
int num = tr[tr[q].l].val - tr[tr[p].l].val;
int mid = l + r >> 1;
if(num >= x) return query(tr[q].l, tr[p].l, l, mid, x);
else return query(tr[q].r, tr[p].r, mid + 1, r, x - num);
}
int main()
{
scanf("%d%d",&n, &m);
for(int i = 1;i <= n;i ++)
{
scanf("%d",&a[i]);
nums.push_back(a[i]);
}
sort(nums.begin(), nums.end());
nums.erase(unique(nums.begin(), nums.end()), nums.end());
root[0] = build(0, nums.size() - 1);
for(int i = 1;i <= n;i ++)
{
int p = lower_bound(nums.begin(), nums.end(), a[i]) - nums.begin();
root[i] = add(root[i - 1], 0, nums.size() - 1, p);
}
for(int i = 1;i <= m;i ++)
{
int l, r, k;
scanf("%d%d%d",&l, &r, &k);
printf("%d\n", nums[query(root[r], root[l - 1], 0, nums.size() - 1, k)]);
}
return 0;
}