MOOC数据结构（上）（自主模式）-范围查询(Range)

范围查询(Range)

---

Descriptioin

Let S be a set of n integral points on the x-axis. For each given interval [a, b], you are asked to count the points lying inside.

Input

The first line contains two integers: n (size of S) and m (the number of queries).

The second line enumerates all the n points in S.

Each of the following m lines consists of two integers a and b and defines an query interval [a, b].

Output

The number of points in S lying inside each of the m query intervals.

Example

Input

5 2
1 3 7 9 11
4 6
7 12

Output

0
3

Restrictions

0 <= n, m <= 5 * 10^5

For each query interval [a, b], it is guaranteed that a <= b.

Points in S are distinct from each other.

Coordinates of each point as well as the query interval boundaries a and b are non-negative integers not greater than 10^7.

Time: 2 sec

Memory: 256 MB

描述

数轴上有n个点，对于任一闭区间 [a, b]，试计算落在其内的点数。

输入

第一行包括两个整数：点的总数n，查询的次数m。

第二行包含n个数，为各个点的坐标。

以下m行，各包含两个整数：查询区间的左、右边界a和b。

输出

对每次查询，输出落在闭区间[a, b]内点的个数。

样例

见英文题面

限制

0 ≤ n, m ≤ 5×105

对于每次查询的区间[a, b]，都有a ≤ b

各点的坐标互异

各点的坐标、查询区间的边界a、b，均为不超过10^7的非负整数

时间：2 sec

内存：256 MB

 

C++:

/*
 @Date    : 2018-02-01 11:38:35
 @Author  : 酸饺子 (changzheng300@foxmail.com)
 @Link    : https://github.com/SourDumplings
 @Version : $Id$
*/

/*
https://dsa.cs.tsinghua.edu.cn/oj/course.shtml?courseid=58
 */

#include <cstdio>
#include <cstdlib>

using namespace std;

const int MAXN = 500001;

int BiSearch(const int num[], int lo, int hi, int value)
{
    int mi;
    while (lo < hi)
    {
        mi = (hi + lo) >> 1;
        value < num[mi] ? hi = mi : lo = mi + 1;
    }
    return --lo;
}

void SearchAndCount(const int num[], const int n, const int low, const int up)
{
    int low_pos = BiSearch(num, 0, n, low);
    int up_pos = BiSearch(num, low_pos, n, up);
    // printf("low_pos = %d, up_pos = %d\n", low_pos, up_pos);
    int count = 0;
    if (num[low_pos] == low)
    {
        for (int i = low_pos; i != -1 && num[i] == low; --i)
            ++count;
    }
    count += up_pos - low_pos;
    printf("%d\n", count);
    return;
}

int cmp(const void *a, const void *b)
{
    return *(int *)a - *(int *)b;
}

int main(int argc, char const *argv[])
{
    int num[MAXN];
    int n, m;
    scanf("%d %d", &n, &m);
    for (int i = 0; i != n; ++i)
        scanf("%d", &num[i]);
    qsort(num, n, sizeof(num[0]), cmp);
    int low, up;
    while (m--)
    {
        scanf("%d %d", &low, &up);
        SearchAndCount(num, n, low, up);
    }
    return 0;
}