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

---

分析

贪心
我们从最左面开始考虑。到距其R以内的区域内必须要带有标记的点，所以要想标记点数最少，则应该是从最左边的点开始，距离为R以内的最远的点。
那么当加入了一个标记后，剩下部分同理。对于添加了符号的点右侧相距超过R的下一个点，采用同样的方式找到其右侧R距离以内最远的点添加标记。

代码如下：

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 1000+10;
int dis[maxn];

int main()
{
    int r,n;
    while(scanf("%d%d",&r,&n)!=EOF)
    {
        if(r==-1 && n==-1) break;
        for(int i=0; i<n; i++)
        {
            scanf("%d",&dis[i]);
        }   
        sort(dis, dis+n);
        int count = 0;
        int i = 0;
        while(i<n)
        {
            int a = dis[i++];
            while(i<n && dis[i]<=a+r) i++;

            int b = dis[i-1];
            while(i<n && dis[i]<=b+r) i++;
            count++; 
        }
        printf("%d\n",count);
    }   
    return 0;
}