2020年首届算法竞赛网络挑战赛（第二季度赛）——正式赛---点名

SaikrVj | 点名

平衡树模板题

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int,int>pii;
const int mod = 1e9 + 7 , INF = 0x3f3f3f3f , N = 1e5 + 10;

struct Node
{
    int l,r;
    int cnt;
}tr[N * 25];
LL a[N];
int n,m;
vector<LL> nums;
int root[N],idx;
int find(LL x)
{
    return lower_bound(nums.begin(),nums.end(),x) - nums.begin();
}

int build(int x,int l,int r)
{
    int q = ++ idx;
    if (l == r)
        return q;
    int mid = l + r >> 1;
    tr[q].l = build(x << 1,l,mid);
    tr[q].r = build(x << 1 | 1,mid + 1,r);
    
    return q;
    
}

int insert(int p,int l,int r,LL v)
{
    int q = ++ idx;
    tr[q] = tr[p];
    
    if (l == r)
    {
        tr[q].cnt ++;
        return q;
    }
    int mid = l + r >> 1;
    if (v <= mid)
        tr[q].l = insert(tr[p].l,l,mid,v);
    else
        tr[q].r = insert(tr[p].r,mid + 1,r,v);
    tr[q].cnt = tr[tr[q].l].cnt + tr[tr[q].r].cnt;
    
    return q;
}

int query(int p,int q,int l,int r,int k)
{
    if (l == r)
        return r;
    
    int cnt = tr[tr[q].l].cnt - tr[tr[p].l].cnt;
    int mid = l + r >> 1;
    if (k <= cnt)
        return query(tr[p].l,tr[q].l,l,mid,k);
    else
        return query(tr[p].r,tr[q].r,mid + 1,r,k - cnt);
}

int main()
{
    cin >> n >> m;
    for (int i = 1 ; i <= n ; i ++)
        cin >> a[i],nums.push_back(a[i]);
    
    sort(nums.begin(),nums.end());
    nums.erase(unique(nums.begin(),nums.end()),nums.end());
    
    build(1,0,nums.size() - 1);
    for (int i = 1 ; i <= n ; i ++)
        root[i] = insert(root[i - 1],0,nums.size() - 1,find(a[i]));
    
    for (int i = 1 ; i <= m ; i ++)
    {
        int r;
        cin >> r;
        cout << nums[query(root[0],root[r],0,nums.size() - 1,i)]<<endl;
    }
}