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.

输入说明：

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.

输出说明：

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

SAMPLEOUTPUT：

2
4

hintS：

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范围内所有军队也都不用携带，标记范围外的第一支军队，从这支军队开始继续重复上述操作，直到遍历了所有的军队。

AC代码：

#include<bits/stdc++.h/**/>
using namespace std;
int main()
{
	int R,n,i,t,p,l=0,sum;
	int a[1005];
	while(scanf("%d%d",&R,&n)&&R!=-1&&n!=-1)
	{
		for(i=0;i<n;i++)
        {
			cin>>a[i];
		}
		sort(a,a+n);
		int l = 0, sum = 0;
		while(l<n)
		{
			t=a[l++];
			while(l<n&&a[l]<=t+R)
			{
			    l++;
            }
			p=a[l-1];
			while(l<n&&a[l]<=p+R)
            {
                l++;
            }
			sum++;
		}
		cout<<sum<<endl;
	}
	return 0;
}