poj3069Saruman's Army

Description

Saruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his forces, Saruman distributes seeing stones, known as palantirs, among the troops. Each palantir has a maximum effective range of R units, and must be carried by some troop in the army (i.e., palantirs are not allowed to “free float” in mid-air). Help Saruman take control of Middle Earth by determining the minimum number of palantirs needed for Saruman to ensure that each of his minions is within R units of some palantir.

Input

The input test file will contain multiple cases. Each test case begins with a single line containing an integer R, the maximum effective range of all palantirs (where 0 ≤ R ≤ 1000), and an integer n, the number of troops in Saruman’s army (where 1 ≤ n ≤ 1000). The next line contains n integers, indicating the positions x₁, …, x_n of each troop (where 0 ≤ x_i ≤ 1000). The end-of-file is marked by a test case with R = n = −1.

Output

For each test case, print a single integer indicating the minimum number of palantirs needed.

Sample Input

0 3
10 20 20
10 7
70 30 1 7 15 20 50
-1 -1

Sample Output

2
4

Hint

In the first test case, Saruman may place a palantir at positions 10 and 20. Here, note that a single palantir with range 0 can cover both of the troops at position 20.

In the second test case, Saruman can place palantirs at position 7 (covering troops at 1, 7, and 15), position 20 (covering positions 20 and 30), position 50, and position 70. Here, note that palantirs must be distributed among troops and are not allowed to “free float.” Thus, Saruman cannot place a palantir at position 60 to cover the troops at positions 50 and 70.

将士兵的坐标进行从小到大排序，从最小的开始a0,a0 + r范围内最靠近右边的为标记点，标记点右边范围内的点不再考虑标记问题，flag代表当前所处位置，flag增加到标记点右边范围以外，则此时的flag就是最右边的点的位置

#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#define maxn 1010
int pa[maxn];
int n,r;
using namespace std;
//从最左边开始a0,a0 + r 内最靠近右边的点为标记点，标记点+-r以内的不再做考虑
//然后找到第一个标记点范围以外的最左边的点再进行上述操作
void solve()
{
    sort(pa, pa + n);
    int num = 0;
    int flag = 0;
    while(flag < n)
    {
        //起始点
        int s = pa[flag];
        //flag不断增加，求出在起始点范围以内的最大点
        //flag代表当前所处位置
        while(flag < n && pa[flag] <= s + r)
        {
            flag++;
        }
        //b为被标记的点
        int b = flag - 1;
        num++;
        //在被标记点右边范围内的点，flag走过，直到走到标记点范围外
        while(flag < n && pa[flag] <= pa[b] + r)
        {
            flag++;
        }
    }
    printf("%d\n", num);
}
int main()
{
    while(~scanf("%d%d", &r, &n))
    {
        if(r == -1 && n == -1 ) break;
        for(int i = 0; i < n; i++)
        {
            scanf("%d", &pa[i]);
        }
        solve();
    }
    return 0;
}