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.Description
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.
题意:
直线上有n个点,点 i 的位置是Xi。从这n个点中选择若干个,给他们加上标记。对于每一个点,其距离为 R 以内区域里必须有带有标记的点。问最少可以有多少个点被标记
思路:
这里就是尽可能选择在R距离里最靠右边的点标记,然后还要有该点向左,向右辐射的距离
注意这里是从被标记点的右端超过R距离的第一个点为起点,重复以上操作
#include<iostream>
#include<algorithm>
using namespace std;
int k,n;
int pre[1005];
int main(){
while(~scanf("%d%d",&k,&n)){
if(k==-1&&n==-1)
break;
for(int i=0;i<n;i++)
cin>>pre[i];
sort(pre,pre+n);
int step;
int i=0;
int sum=0;
while(i<n){
step = pre[i];//这点没有被标记
i++;
while(i<n&&pre[i]<=step+k)
i++;//辐射左边
int p = pre[i-1];
//cout<<p<<endl;
while(i<n&&pre[i]<=p+k)
i++;//辐射右边
sum++;
}
cout<<sum<<endl;
}
}