hdu4417（主席树）

题意：求区间中比某个数小的数字有几个

思路：离散化，然后用主席树来解就可以了

这题让我遇到了很少遇到的情况 Runtime Error（STACK_OVERFLOW）,出现这个的原因是递归没退出来

代码如下：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define N 100005
#define inf 0x7ffffff
#define eps 1e-9
#define pi acos(-1.0)
using namespace std;
int a[N],b[N];
struct node
{
    int l,r,num;
}tree[N*20];
int rt[N];
int cur;
void PushUp(int k)
{
    tree[k].num = tree[tree[k].l].num + tree[tree[k].r].num;
}
int build(int l,int r)
{
    int k = cur++;
    if(l == r)
    {
        tree[k].num = 0;
        return k;
    }
    int m = (l+r)/2;
    tree[k].l = build(l,m);
    tree[k].r = build(m+1,r);
    PushUp(k);
    return k;
}
int update(int o,int l,int r,int pos ,int val)
{
    int k = cur++;
    tree[k] = tree[o];
    if(l == r)
    {
        tree[k].num += val;
        return k;
    }
    int m = (l+r)/2;
    if(pos <= m) tree[k].l = update(tree[o].l,l,m,pos,val);
    else tree[k].r = update(tree[o].r,m+1,r,pos,val);
    PushUp(k);
    return k;
}
int query(int l,int r,int ox,int oy,int x,int y)
{
    if(x <= l && r <= y)
        return tree[oy].num - tree[ox].num;
    int m = (l+r)/2;
    int res = 0;
    if(x <= m) res += query(l,m,tree[ox].l,tree[oy].l,x,y);
    if(y > m) res += query(m+1,r,tree[ox].r,tree[oy].r,x,y);
    return res;
}
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
    int t,z = 1;
    scanf("%d",&t);
    while(t--)
    {
        cur = 0;
        int n,q;
        scanf("%d%d",&n,&q);
        int i;
        for(i = 0; i < n; i++){
            scanf("%d",&a[i]);
            b[i] = a[i];
        }
        sort(b,b+n);
        int m = unique(b,b+n) - b;
        rt[0] = build(1,m);
        for(i = 0; i < n; i++)
        {
            int pos = lower_bound(b,b+m,a[i]) - b + 1;//???
            rt[i+1] = update(rt[i],1,m,pos,1);
        }
        printf("Case %d:\n",z++);
        while(q--)
        {
            int x,y,k;
            scanf("%d%d%d",&x,&y,&k);
            x++;
            y++;
            int k1 = lower_bound(b,b+m,k) - b + 1;
            if(b[k1-1] != k) k1--;
            //cout<<k1<<"fd"<<endl;
            if(k1 == 0) {printf("0\n");continue;}//这里注意下
            printf("%d\n",query(1,m,rt[x-1],rt[y],1,k1));
        }
    }
    return 0;
}