题目链接:http://poj.org/problem?id=3069
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 4285 | Accepted: 2203 |
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 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.
Source
题意:直线上有N个点,点i的位置是Xi,从这N个点中选择若干个,给它们加上标记。对每一个点,其距离为R以内的区域里必须带有标记的点,在满足这个的条件下,希望能为尽量少的点添加标记。求最少点的数目。
算法:
先排序,然后从最左边的点开始,以距离为R以内的最远点为中心点,再继续向右找出第一个不在以中心点为中心半径为R的点,最后继续同样的操作直到找出所有的中心点。
AC代码:
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<sstream>
#include<vector>
#include<map>
#include<list>
#include<set>
#include<queue>
#define LL long long
using namespace std;
const int maxn=1005,maxe=100005,inf=1<<29;
int n,r,a[maxn];
int main()
{
while(~scanf("%d%d",&r,&n)&&!(r==-1&&n==-1))
{
for(int i=0;i<n;i++) scanf("%d",&a[i]);
sort(a,a+n);
int i=0,s,p,ans=0;
while(i<n)
{
s=a[i++];
while(i<n&&a[i]<=s+r) i++;
p=a[i-1];
while(i<n&&a[i]<=p+r) i++;
ans++;
}
printf("%d\n",ans);
}
return 0;
}