HDU 4417-Super Mario（主席树）

题意：n个数，m次查询，问你任意区间中比x小的数的个数

题解：之前用离线树状数组搞得，学了主席树决定主席树搞搞，问题可以转化为x为区间第几小。

然而wa上一晚上，本以为是主席树理解错了，打算重学，后来发现是一个地方1打成了L。。。呵呵

#include<set>  
#include<map>         
#include<stack>                
#include<queue>                
#include<vector>        
#include<string>      
#include<math.h>       
#include<stdio.h>                
#include<iostream>                
#include<string.h>                
#include<stdlib.h>        
#include<algorithm>       
#include<functional>        
using namespace std;
typedef long long ll;
#define inf 1000000000           
#define mod 1000000007                 
#define maxn  100005    
#define PI 3.1415926  
#define lowbit(x) (x&-x)     
#define eps 1e-9   
int sum[maxn * 5], rt[maxn], ls[maxn * 5], rs[maxn * 5];
int n, m, cnt, a[maxn], b[maxn], num, xx, yy;
void build(int &id, int l, int r)
{
	id = ++cnt;
	sum[id] = 0;
	int mid = (l + r) / 2;
	if (l == r) return;
	build(ls[id], l, mid);
	build(rs[id], mid + 1, r);
}
void update(int &id, int l, int r, int last, int val)
{
	id = ++cnt;
	ls[id] = ls[last];
	rs[id] = rs[last];
	int mid = (l + r) / 2;
	sum[id] = sum[last] + 1;
	if (l == r) return;
	if (val <= mid)
		update(ls[id], l, mid, ls[last], val);
	else
		update(rs[id], mid + 1, r, rs[last], val);
}
int query(int st, int ed, int l, int r)
{
	if (xx <= l && yy >= r)
		return sum[ed] - sum[st];
	int mid = (l + r) / 2, res = 0;
	res += query(ls[st], ls[ed], l, mid);
	if (yy > mid)
		res += query(rs[st], rs[ed], mid + 1, r);
	return res;
}
int main(void)
{
	int T, l, r, x, i, cases = 0;
	scanf("%d", &T);
	while (T--)
	{
		num = cnt = 0;
		scanf("%d%d", &n, &m);
		for (i = 1;i <= n;i++)
			scanf("%d", &a[i]), b[i] = a[i];
		sort(b + 1, b + n + 1);
		num = unique(b + 1, b + n + 1) - b - 1;
		for (i = 1;i <= n;i++)
			a[i] = lower_bound(b + 1, b + num + 1, a[i]) - b;
		build(rt[0], 1, num);
		for (i = 1;i <= n;i++)
			update(rt[i], 1, num, rt[i - 1], a[i]);
		printf("Case %d:\n", ++cases);
		while (m--)
		{
			scanf("%d%d%d", &l, &r, &x);
			l++;r++;xx = 1;
			yy = lower_bound(b + 1, b + num + 1, x) - b;
			if (b[yy] > x) yy--;
			if (yy > 0)
				printf("%d\n", query(rt[l - 1], rt[r], 1, num));
			else
				printf("0\n");
		}
	}
	return 0;
}