简单贪心

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.

 

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

int cmp(int x, int y)
{
	return x < y;
}
int main()
{
	int r, n,m[1005];
	int i;
	while (scanf("%d%d", &r, &n) != EOF&&r!=-1&&n!=-1)
	{
		int sum = 0;
		for (i = 0; i < n; i++)
		{
			scanf("%d", &m[i]);
		}
		i = 0;
		sort(m, m+n, cmp);
		while (i < n)
		{
			int s = m[i++];//s表示没有被覆盖的最左边的点 

			while (i < n && s + r >= m[i])//一直向右前进直到距s的距离大于R的点 
				i++;
			int p = m[i - 1];//p表示最右边的未被覆盖的区域
			while (i < n && p + r >= m[i]) /一直向右前进直到距p的距离大于R的点 
				i++;
			sum++;
		}
		printf("%d\n",sum);

	}
	return 0;
}

还不太懂啊啊