题目链接:
hdu 4417 Super Mario
牛客小白月赛9 E
hdu4417
/*主席树求[L,R]内小于等于x的个数*/
#include"bits/stdc++.h"
using namespace std;
typedef long long LL;
const int maxn=2e6+5;
int Ls[maxn],Rs[maxn],tree[maxn];//保存左右儿子
int a[maxn],b[maxn];//a是离散化后的,b是原数组
vector<int>root;
int N,Q,n,tot;
int Build(int L,int R)
{
int id=++tot;
tree[id]=0;
if(L==R)return id;
int mid=L+R>>1;
Ls[id]=Build(L,mid);
Rs[id]=Build(mid+1,R