POJ 3069 Saruman's Army（贪心算法）

最新推荐文章于 2023-07-25 08:25:19 发布

LiQiyaoo

最新推荐文章于 2023-07-25 08:25:19 发布

阅读量461

点赞数

分类专栏： acm 文章标签：贪心算法

本文链接：https://blog.csdn.net/L_BestCoder/article/details/51944659

版权

acm 专栏收录该内容

76 篇文章 2 订阅

订阅专栏

Saruman's Army

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7526		Accepted: 3845

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.

思路：用贪心算法的思路，在覆盖时，尽可能的覆盖更靠右边的点。从以第一个未覆盖的点开始，找到其右侧距离R以内最远的点添加标记，在找到下一个未覆盖的点，重复此操作。

代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<set>
#include<algorithm>
using namespace std;
set<int> s;
int a[1005];
int main()
{
	int n, r, i, j, right, first, cnt, k, x;
	while(scanf("%d%d", &r, &n) != EOF && (r != -1) && (n != -1))
	{
		s.clear();
		first = 1;
		cnt = 0;
		k = 0;
		for(i = 0; i < n; i++)
		{
			scanf("%d", &x);
			s.insert(x);
		}
		for(set<int>::iterator it = s.begin();it != s.end();it++)//输入数据去重并排序 
		{
			a[k++] = *it;
		}
		i = 0;
		while(i < k)
		{
			int s = a[i];//S是没有被覆盖最左的点的位置 
			while(i < k && a[i] <= s + r)i++;//一直向右前进直到距离S最大的r的点 
			int p = a[i - 1];//p是新标记的点的位置 
			while(i < k && a[i] <= p + r)i++;//一直前进直到距p的距离大于R的点 
			cnt++;
		}
		cout<<cnt<<endl;
	}
	return 0;
}