分析:
主席树板子
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;//三年竞赛一场空,不开long long见祖宗
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endsl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define x first
#define y second
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const int maxn = 2e5 + 10; //注意数据量的大小,因题而异
const int inf = 0x3f3f3f3f;
struct node
{
int l, r;
int cnt;
}t[maxn << 5];
int n, m;
int a[maxn], sorted[maxn];
int root[maxn], idx;
int tot;
int getid(int x)
{
return lower_bound(sorted + 1, sorted + 1 + tot, x) - sorted;
}
void build(int& now, int l, int r)
{
now = ++idx;
t[now].cnt = 0;
if(l == r) return;
int mid = l + r >> 1;
build(t[now].l, l, mid), build(t[now].r, mid + 1, r);
}
void insert(int pre, int& now, int val, int l, int r)
{
now = ++idx;
t[now] = t[pre];
if(l == r)
{
t[now].cnt++;
return;
}
int mid = l + r >> 1;
if(val <= mid) insert(t[pre].l, t[now].l, val, l, mid);
else insert(t[pre].r, t[now].r, val, mid + 1, r);
t[now].cnt++;
}
int query(int pre, int now, int k, int l, int r)
{
if(l == r) return l;
int mid = l + r >> 1;
int dif = t[t[now].l].cnt - t[t[pre].l].cnt;
if(k <= dif) return query(t[pre].l, t[now].l, k, l, mid);
else return query(t[pre].r, t[now].r, k - dif, mid + 1, r);
}
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i++) cin >> a[i], sorted[i] = a[i];
sort(sorted + 1, sorted + 1 + n);
tot = unique(sorted + 1, sorted + 1 + n) - sorted - 1;
build(root[0], 1, tot);
for(int i = 1; i <= n; i++) insert(root[i - 1], root[i], getid(a[i]), 1, tot);
while(m--)
{
int l, r, k; cin >> l >> r >> k;
cout << sorted[query(root[l - 1], root[r], k, 1, tot)] << endl;
}
}