hdu 4417 离线树状数组

#include <cstdio>
#include <algorithm>
using namespace std;
struct Point {
int l,r,id,x;
}p[100010],q[100010];
int C[100010];
int n,m;
int ans[100010];
int cmp(Point a,Point b){
return a.x<b.x;
}
int lowbit(int x){
return x&(-x);
}
int sum(int x){
int ret=0;
while (x>0) {
ret+=C[x];x-=lowbit(x);
}
return ret;
}
int add(int x,int d){
while (x<=n){
C[x]+=d;x+=lowbit(x);
}
return 0;
}
int query(int L,int R){
return sum(R)-sum(L-1);
}
int main (){
int T,t=1;
scanf("%d",&T);
while (t<=T){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++){
scanf("%d",&p[i].x);
p[i].id=i;
C[i]=0;
}
for (int i=1;i<=m;i++){
scanf("%d%d%d",&q[i].l,&q[i].r,&q[i].x);
q[i].id=i;
q[i].l++;
q[i].r++;
}
sort(p,p+n+1,cmp);
sort(q,q+m+1,cmp);
int i,j;
for (i=j=1;j<=m;j++){
while (i<=n&&p[i].x<=q[j].x){
add(p[i].id,1);
i++;
}
//printf("%d %d %d %d %d\n",i,q[j].x,q[j].id,q[j].l,q[j].r);
//for (int k=1;k<=n;k++)
//  printf("%d ",C[k]);
//printf("\n");
ans[q[j].id]=query(q[j].l,q[j].r);
}
printf("Case %d:\n",t);
for (int j=1;j<=m;j++)
printf("%d\n",ans[j]);
t++;
}
return 0;
}