每日一题 Saruman‘s Army

Saruman’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 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.

贪心策略： 起初全部的点都不在标记区域内，从最左边的点（未标记区域的最左边的点）开始向右找，找到区域R内的最后一个点，将这个点标记。再从该标记点开始向右找到区域R外的第一个点，这个点左边的点已经都在标记区域内，而这个点就是未标记区域的最左边的点，重复上述过程即可完成。

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 1010;
int a[N];
int r,n;
int main()
{
	while (cin >> r >> n && r!=-1 && n!=-1)
	{
		int res = 0;
		for (int i = 0;i < n;i++) cin >> a[i];
		sort(a, a + n);
		
		int k = 0;
		while (k < n)
		{
			int s = a[k++]; //用s记录 没有覆盖的区域的最左边的点。
			while (k < n && a[k] <= s + r) k++; //找到 在s点区域外的第一个点。

			int t = a[k - 1]; //用t记录s点区域内的最后一个点的位置，这个点就是标记点。
			while (k < n && a[k] <= t + r) k++; //找到 在t点区域外的第一个点。
			res++;
		}
		cout << res << endl;
	}
	return 0;
}