Flowers---hdu4325（区间处理 离散化）

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<vector>
using namespace std;
#define N 1001100
#define INF 0x3f3f3f3f
#define met(a) memset(a, 0, sizeof(a))
struct node
{
    int x,y;
}a[N];
int b[N], f[N];
int main()
{
    int T, n, m, x, t=1, Max;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d%d", &n, &m);
        met(a);met(b);met(f);
        int k=0;
        Max = -INF;
        for(int i=1; i<=n; i++)
        {
            scanf("%d %d", &a[i].x, &a[i].y);
            b[k++]=a[i].x;
            b[k++]=a[i].x-1;
            b[k++]=a[i].y;
            b[k++]=a[i].y+1;
        }
        sort(b, b+k);
        k=unique(b, b+k)-b;
        for(int i=1; i<=n; i++)
        {
            int p=lower_bound(b, b+k, a[i].x)-b;
            int q=lower_bound(b, b+k, a[i].y)-b;
            f[p]++;
            f[q+1]--;
            Max = max(Max, q+1);
        }
        for(int i=1; i<=Max; i++)///防止TLE；
            f[i] += f[i-1];
        printf("Case #%d:\n", t++);
        while(m--)
        {
            scanf("%d", &x);
            int ans=0;
            int p=lower_bound(b, b+k, x)-b;
            ans = f[p];
            printf("%d\n", ans);
        }
    }
    return 0;
}