贪心算法——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 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.

---

样例输入：

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

---

样例输出：

2
4

---

原因分析：

题目大意为：输入两个数，一个为最大的范围R,一个为石头的个数，求解，能把所有的数据包括的最小的石头数。例如第二组数据，

可以放置在位置7（覆盖位置1、7和15的部队）、位置20（覆盖位置20和30）、位置50和位置70。输出为4.

本题运用贪心的思想，先排序，在逐个遍历每一个数，向它的左右确定其所覆盖的范围，并计数。

---

解决方案：

#include "stdio.h"
#include "string.h"
#include "algorithm"
using namespace std;
int main ()
{
	int i,ans,r,n;
	int a[1100];
	while(~scanf("%d%d",&r,&n)&&r>=0&&n>=0)
	{
		ans=0;
		for(i=0;i<n;i++)
		scanf("%d",&a[i]);
		sort(a,a+n);
		i=0;
		while(i<n)
		{
			int s=a[i++];
			while(i<n&&a[i]<=s+r)//从该数的右侧查找。 
			i++;
			int p=a[i-1];
			while(i<n&&a[i]<=p+r)//从左侧。 
			i++;
			ans++;
		}
		printf("%d\n",ans);
	}
	return 0;
}