Mario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble again and Mario needs to save his lover. We regard the road to the boss’s castle as a line (the length is n), on every integer point i there is a brick on height hi. Now the question is how many bricks in [L, R] Mario can hit if the maximal height he can jump is H.

1

10 10

0 5 2 7 5 4 3 8 7 7

2 8 6

3 5 0

1 3 1

1 9 4

0 1 0

3 5 5

5 5 1

4 6 3

1 5 7

5 7 3

Case 1:

4

0

0

3

1

2

0

1

5

1

代码：

#include<cstdio>

#include<iostream>

#include<cstring>

#include<algorithm>

#include<queue>

#include<stack>

#include<set>

#include<vector>

#include<map>

#include<cmath>

const int maxn=1e5+;

typedef long long ll;

using namespace std;

struct node

{

    int l,r;

    int num;

}tree[maxn<<];

struct node1

{

    int pos,l,r,h;

    bool friend operator <(node1 x, node1 y)

    {

        return x.h<y.h;

    }

}h[maxn];

struct node2

{

    int pos,h;

    bool friend operator <(node2 x,node2 y)

    {

        return x.h<y.h;

    }

}p[maxn];

void pushup(int m)

{

    tree[m].num=(tree[m<<].num+tree[m<<|].num);

    return;

}

void build(int m,int l,int r)

{

    tree[m].l=l;

    tree[m].r=r;

    tree[m].num=;

    if(l==r)

    {

        return ;

    }

    int mid=(tree[m].l+tree[m].r)>>;

    build(m<<,l,mid);

    build(m<<|,mid+,r);

    return;

}

void update(int m,int index,int val)

{

    if(tree[m].l==index&&tree[m].l==tree[m].r)

    {

        tree[m].num=val;

        return ;

    }

    int mid=(tree[m].l+tree[m].r)>>;

    if(index<=mid)

    {

        update(m<<,index,val);

    }

    else

    {

        update(m<<|,index,val);

    }

    pushup(m);

    return ;

}

int  query(int m,int l,int r)

{

    if(tree[m].l==l&&tree[m].r==r)

    {

        return tree[m].num;

    }

    int mid=(tree[m].l+tree[m].r)>>;

    if(r<=mid)

    {

        return query(m<<,l,r);

    }

    else if(l>mid)

    {

        return query(m<<|,l,r);

    }

    else

    {

        return query(m<<,l,mid)+query(m<<|,mid+,r);

    }

}

int a[maxn];

int main()

{

   int T;

   cin>>T;

   for(int k=;k<=T;k++)

   {

       int n,m;

       scanf("%d%d",&n,&m);

       for(int t=;t<=n;t++)

    {

        scanf("%d",&p[t].h);

        p[t].pos=t;

    }

    for(int t=;t<=m;t++)

    {

        scanf("%d%d%d",&h[t].l,&h[t].r,&h[t].h);

        h[t].l++;

        h[t].r++;

        h[t].pos=t;

    }

    printf("Case %d:\n",k);

    build(,,n);

    sort(p+,p+n+);

    sort(h+,h+m+);

    int j=;

    int s=;

    while(s<=n)

    {

        if(p[s].h>h[j].h)

        {

        //    cout<<h[j].l<<" "<<h[j].r<<endl;

            a[h[j].pos]=query(,h[j].l,h[j].r);

            j++;

            if(j>m)

            {

                break;

            }

        }

        else

        {

            update(,p[s].pos,);

            s++;

        }

    }

    while(j<=m)

    {

            a[h[j].pos]=query(,h[j].l,h[j].r);

            j++;

    }

    for(int t=;t<=m;t++)

    {

        printf("%d\n",a[t]);

    }

   }

   return ;

}