Saruman's Army 【辐射区间贪心】

Saruman’s Army
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 9800 Accepted: 4933
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 x1, …, xn of each troop (where 0 ≤ xi ≤ 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.

思路 ：题目大意 给你n个点 和辐射半径r（只有被选中的点才可以辐射）。问至少要选中多少个点才可以将所有的点都辐射在内 。
学习了
代码

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#define LL long long
#define M  1000000+100
#define inf 0x3f3f3f3f
#define mod 100009
using namespace std;
int arr[M];
int main()
{
     int n,r;
     while(scanf("%d%d",&r,&n)&&(n!=-1||r!=-1))
     {
        int i,j;
        for(i=0;i<n;i++)
        scanf("%d",&arr[i]);
        sort(arr,arr+n);
        int ans=0;

        for(i=0;i<n;i++) // 辐射的找点，下标一定要 弄清楚
        {
            int k=arr[i]; 
            while(i+1<n&&arr[i+1]-r<=k) i++;

            k=arr[i];
            while(i+1<n&&arr[i+1]-r<=k) i++;
            ans++;
          }
          printf("%d\n",ans);
      }
    return 0;
}