div2 #602 (线段树维护区间第i个数）

题目链接

题目大意：
给你一串n个数的序列，然后m个询问a b
问你在1~n区间内选取a个和最大的那个区间，并选取下标字典序最小的那个区间，输出这个区间内第b个数。

总结：
1e6，2e5的操作次数的数据，可以考虑线段树。
multiset选取某个位置的数，可以用这题线段树的用法替代。

线段树做法：

#include <bits/stdc++.h>

#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define lson node<<1
#define rson node<<1|1
 
using namespace std;
 
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;
 
template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }

const int maxn = 2 * (int)1e5 + 1000;
int n, tree[maxn << 2], m, b[maxn], ans[maxn];
struct node {
	int num, id;
}a[maxn];
struct query {
	int k, pos, id;
}q[maxn];

bool cmp1(node a, node b) {
	if (a.num == b.num) return a.id < b.id;
	return a.num > b.num;
}
bool cmp2(query a, query b) {
	return a.k > b.k;
}
void pushup(int node) {
	tree[node] = tree[lson] + tree[rson];
}
void build(int l, int r, int node) {
	if (l == r) {
		tree[node] = 1;
		return;
	}
	int mid = (l + r) >> 1;
	build(l, mid, lson);
	build(mid + 1, r, rson);
	pushup(node);
}
void del(int l, int r, int node, int pos) {
	if (l == r) {
		tree[node] = 0;
		return;
	}
	int mid = (l + r) >> 1;
	if (pos <= mid) del(l, mid, lson, pos);
	else del(mid + 1, r, rson, pos);
	pushup(node);
}
int zhao(int l, int r, int node, int num) {
	if (l == r) return l;
	int mid = (l + r) >> 1;
	if (tree[lson] >= num) zhao(l, mid, lson, num);
	else zhao(mid + 1, r, rson, num - tree[lson]);
}
 
int main() {
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(10);
    cout << fixed;
#ifdef LOCAL_DEFINE
    freopen("in", "r", stdin);
#endif
	
	cin >> n;
	for1(i, n) {
		cin >> a[i].num;
		b[i] = a[i].num;
		a[i].id = i;
	}        
	sort(a + 1, a + 1 + n, cmp1);
	cin >> m;
	for1(i, m) {
		cin >> q[i].k >> q[i].pos;
		q[i].id = i;
	}
	sort(q + 1, q + 1 + m, cmp2);
	int now = n;
	build(1, n, 1);
	for1(i, m) {
		while (q[i].k < now) {
			del(1, n, 1, a[now].id);
			--now;
		}
		int res = zhao(1, n, 1, q[i].pos);
		ans[q[i].id] = b[res];
	}
	for1(i, m) {
		cout << ans[i] << '\n';
	}

#ifdef LOCAL_DEFINE
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}