POJ 3069 Saruman's Army(贪心)

原创 2015年11月17日 18:31:48

Saruman's Army

Time Limit: 1000MS


Memory Limit: 65536K

Total Submissions: 5954


Accepted: 3037

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.


题意:在一条直线上,有n个点。从这n个点中选择若干个,给他们加上标记。对于每一个点,其距离为R以内的区域里必须有一个被标记的点。问至少要有多少点被加上标记。


题解:我们从最左边的开始考虑。对于这个点,到距其R以内的区域必须要有带有标记的点。带有标记的点一定在其右侧(包含这个点本身)。给从最左边开始,距离为R以内的最远的点加上标记,尽可能的覆盖更靠右边的点。对于添加了标记的点右侧相距超过R的下一个点,采用同样的方法找到最右侧R距离以内最远的点添加标记。在所有点都被覆盖之前不断重复这一过程。


代码如下:


#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[1010];
int main()
{
	int n,R,i,ans;
	while(scanf("%d%d",&R,&n)&&R!=-1||n!=-1)
	{
		for(i=0;i<n;++i)
			scanf("%d",&a[i]);
		sort(a,a+n);
		i=0;ans=0;
		while(i<n)
		{
			int s=a[i++];//s表示没有被覆盖的最左边的点 
			while(i<n&&a[i]<=s+R)//一直向右前进直到距s的距离大于R的点 
				i++;
			int p=a[i-1];//被标记的点 
			while(i<n&&a[i]<=p+R)//一直向右前进直到距p的距离大于R的点 
				i++;
			ans++;
		}
		printf("%d\n",ans);
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。如有错误,欢迎指出~(@^_^@)~

Poj 3069 Saruman's Army【贪心】

Saruman's Army Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 5742   Accepted: 2...

POJ3069 Saruman's Army

Saruman's Army Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4214   ...

Saruman's Army

#include #include #include using namespace std;#define MAX_N 2000int N,R; int X[MAX_N];void solve(...
  • NoMasp
  • NoMasp
  • 2015年05月19日 15:17
  • 1884

POJ-3069-Saruman's Army

这个题是说给你n个点,然后让你标记其中尽可能少的点,使得n个点都处于被标记点左右不超过R的区间内, 思路:贪心~尽量充分利用区间 代码: #include #include #include #...

poj3069 贪心

题意:直线上有n个点,点i的位置是Xi。从这n个点中选择若干个,给它们加上标记。对每一个点,其距离为R以内的区域里必须有带标记的点(本身为带有标记的点,可以认为与其距离为0的地方有一个带有标记的点)。...
  • aidway
  • aidway
  • 2016年04月08日 22:46
  • 257

Saruman's_Army

Description Saruman the White must lead his army along a straight path from Isengard to Helm’s ...
  • csx0987
  • csx0987
  • 2015年05月09日 11:07
  • 134

poj3069Saruman's Army(贪心)

题意直线上有一些点。现在能给一部分点加buff,加了buff的点能影响到周围r的范围内的点。问最少要给多少点加buff才能影响到所有的点思路典型的贪心,每次尽量找能影响到当前的最靠右的点来加buff,...
  • readlnh
  • readlnh
  • 2016年08月18日 00:52
  • 237

POJ 3617 Best Cow Line ||POJ 3069 Saruman's Army贪心

带来两题贪心算法的题。 1.给定长度为N的字符串S,要构造一个长度为N的字符串T。起初,T是一个空串,随后反复进行下面两个操作:1.从S的头部删除一个字符,加到T的尾部。2.从S的尾部删除一个字符,加...

poj 3069

#include #include int r, n; int points[1001]; using namespace std; int main() { while(~(scan...

poj3069

算法
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 3069 Saruman's Army(贪心)
举报原因:
原因补充:

(最多只允许输入30个字)