查詢時對於高度H二分hash值得到k值,查詢1-k區間內的個數
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include<bitset>
#include <set>
#include <map>
#define clc(arr, val) memset(arr, val, sizeof(arr))
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define IN freopen ("in.txt" , "r" , stdin);
#define OUT freopen ("out.txt" , "w" , stdout);
typedef long long LL;
typedef unsigned long long ULL;
const int MAXN = 120000;
const int MAXM = 6000010;
const int INF = 0x3f3f3f3f;
const LL mod = (LL)1<<32;
const double eps= 1e-8;
const double pi=acos(-1.0);
#define lson l,m, rt<<1
#define rson m+1,r,rt<<1|1
int Hash[MAXN],a[MAXN],all;
int T[MAXN],L[MAXN<<5],R[MAXN<<5],sum[MAXN<<5];
int build(int l,int r)
{
int rt=(++all);
sum[rt]=0;
if(l==r) return rt;
int m=(l+r)>>1;
L[rt]=build(l,m);
R[rt]=build(m+1,r);
return rt;
}
int update(int pre,int x,int l,int r)
{
int rt=(++all);
L[rt]=L[pre],R[rt]=R[pre],sum[rt]=sum[pre]+1;
if(l==r) return rt;
int m=(l+r)>>1;
if(x<=m) L[rt]=update(L[pre],x,l,m);
else R[rt]=update(R[pre],x,m+1,r);
return rt;
}
int query(int u,int v,int k,int l,int r)
{
if(1<=l&&r<=k)
return sum[v]-sum[u];
int m=(l+r)>>1;
int res=0;
res+=query(L[u],L[v],k,l,m);
if(k>m)
res+=query(R[u],R[v],k,m+1,r);
return res;
}
int main()
{
int n,q,t,cas=1;
cin>>t;
while(t--)
{
printf("Case %d:\n",cas++);
cin>>n>>q;
all=0;
for(int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
Hash[i]=a[i];
}
sort(Hash+1,Hash+n+1);
int tol=unique(Hash+1,Hash+n+1)-Hash-1;
T[0]=build(1,tol);
for(int i=1;i<=n;i++)
{
int x=lower_bound(Hash+1,Hash+tol+1,a[i])-Hash;
T[i]=update(T[i-1],x,1,tol);
}
while(q--)
{
int l,r,k;
scanf("%d%d%d",&l,&r,&k);
l++,r++;
int g=lower_bound(Hash+1,Hash+tol+1,k)-Hash;
if(Hash[g]>k)
g--;
int x;
if(g>0)
x=query(T[l-1],T[r],g,1,tol);
else x=0;
printf("%d\n",x);
}
}
return 0;
}