POJ - 3069 Saruman's Army

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_nof 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.

题意：第一行R,N  R代表半径；N代表有N个点

    然后是N个点在横坐标上的坐标(点可能重复)

如果对某一点加上标记，让其以R为半径内的点都在次标记之下，求至少要对多少点施加次标记，才能覆盖所有的点。

说的有点抽象，可以看一下本题的第二个样例，其实题很简单，就是一道贪心扫描题。

我们只需要从左边开始(升序之后), 找到距离为R以内的最远的点，然后依次重复即可！

#include <stdio.h>
#include <algorithm>
int main() {
	int R, N;
	int a[1005];
	while(scanf("%d%d",&R, &N) && (R+N) >= 0) {
		for(int i = 0; i < N; i++) {
			scanf("%d",&a[i]);
		}
		std::sort(a, a+N);
		int l = 0, sum = 0;
		while(l < N) {
			int t = a[l++];                   //最左边的点 
			while(l < N && a[l] <= t + R) l++;//一直往右找 
			int p = a[l-1];                   //新标记的点 
			while(l < N && a[l] <= p + R) l++;//一直往右前进直到距p的距离大于R的点 
			sum++;
		}
		printf("%d\n",sum);
	}
	return 0;
}