題目鏈接：http://poj.org/problem?id=3069

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?x₁, …,?x_n?of each troop (where 0 ≤?x_i?≤ 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.

題目大意：直線上有N個點。點i的位置是Xi。從這N個點中選擇若干個，給他們加上標記。對每一個點，其距離為R以內的區域里必須有個帶有標記的點（自己本身帶有標記的點，可以認為其與距離為0的地方有一個帶有標記的點）。在滿足這個條件的情況下，希望能為盡可能少的點添加標記。問至少要有多少點被加上標記？

思路：從最左邊的點開始，距離為R以內的最遠距離的點，加上了第一個標記以后，剩下的部分也用同樣的辦法進行處理。

#include<iostream> #include<cstdio> #include<algorithm> #define M 1000+5 using namespace std;int main(){int a[M],R,N;while(scanf("%d%d",&R, &N)!=EOF&& R!=-1 &&N!=-1){for(int i=0 ; i<N; ++i){cin>>a[i];}sort(a,a+N);int i=0,ans=0;while(i<N){//s是沒有被覆蓋的最左邊的點的位置 int s=a[i++];//一直向右前進知道距離s的距離大于R的點 while(i<N&& a[i]<=R+s) ++i;//e是新加上標記的點的位置 int e=a[--i]; //一直向右直到距e的距離大于R的點 while(i<N&& a[i]<=e+R) ++i;++ans; }printf("%d\n",ans); }return 0; }

總結

以上是生活随笔為你收集整理的POJ 3069 Saruman's Army(贪心)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。