HDU 4325 Flowers（树状数组+离散化）

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 2*1e5+5;

int n, m, tot;
int a[maxn+1000],c[maxn];

struct node
{
int l,r;
}query[maxn/2];

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;
}

void add(int x, int d)
{
while(x<=maxn)
{
c[x]+=d;
x+=lowbit(x);
}
}

int main()
{
//freopen("in.txt","r",stdin);
int T;
int kase = 0;
scanf("%d",&T);
while(T--)
{
tot = 0;
memset(c,0,sizeof(c));
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d%d",&query[i].l,&query[i].r);
a[tot++] = query[i].l;
a[tot++] = query[i].r;
}
a[tot++] = 0;
sort(a,a+tot);
int tmp = tot;
for(int i=1;i<tmp;i++)
if(a[i]-a[i-1]>1)  a[tot++] = a[i]-1;
sort(a,a+tot);
int num = unique(a,a+tot)-a;
for(int i=1;i<=n;i++)
{
int l = lower_bound(a,a+num,query[i].l)-a;
int r = lower_bound(a,a+num,query[i].r)-a;
add(l,1);
add(r+1,-1);
}
printf("Case #%d:\n",++kase);
while(m--)
{
int x; scanf("%d",&x);
x = lower_bound(a,a+num,x)-a;
printf("%d\n",sum(x));
}
}
return 0;
}