题目链接: P3834 【模板】可持久化线段树 2(主席树)
代码
注意离散化后的nn与n
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<unordered_set>
#include<unordered_map>
using namespace std;
//extern "C"{void *__dso_handle=0;}
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define lowbit(x) x&-x
const double PI=acos(-1.0);
const double eps=1e-6;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
const int maxn=2e5+10;
const int maxm=100+10;
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int a[maxn],b[maxn],num=0,root[maxn];
struct Tree
{
int ls,rs,sum;
}tree[maxn*20];
void add(int l,int r,int p,int pre,int &now)
{
now=++num;
tree[now]=tree[pre];
tree[now].sum++;
if(l==r) return;
int mid=(l+r)>>1;
if(p<=mid) add(l, mid, p, tree[pre].ls, tree[now].ls);
else add(mid+1, r, p, tree[pre].rs, tree[now].rs);
}
int query_k(int l,int r,int k,int ql1,int qr)
{
if(l==r) return l;
int mid=(l+r)>>1;
int s1=tree[tree[qr].ls].sum-tree[tree[ql1].ls].sum;
if(s1>=k) return query_k(l, mid, k, tree[ql1].ls, tree[qr].ls);
else return query_k(mid+1, r, k-s1, tree[ql1].rs, tree[qr].rs);
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
b[i]=a[i];
}
sort(b+1,b+1+n);
int nn=unique(b+1, b+1+n)-(b+1);
for(int i=1;i<=n;i++) a[i]=lower_bound(b+1, b+1+nn, a[i])-b;
for(int i=1;i<=n;i++) add(1, nn, a[i], root[i-1], root[i]);
while(m--)
{
int l,r,k;
scanf("%d%d%d",&l,&r,&k);
printf("%d\n",b[query_k(1, nn, k, root[l-1], root[r])]);
}
}