POJ-3069 Saruman's Army (贪心)
来源:互联网 发布:口袋操作系统 linux 编辑:程序博客网 时间:2024/04/28 15:29
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 ofR 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.
The input test file will contain multiple cases. Each test case begins with a single line containing an integerR, the maximum effective range of all palantirs (where 0 ≤ R ≤ 1000), and an integern, the number of troops in Saruman’s army (where 1 ≤ n ≤ 1000). The next line contains n integers, indicating the positionsx1, …, xn of each troop (where 0 ≤ xi ≤ 1000). The end-of-file is marked by a test case withR = n = −1.
For each test case, print a single integer indicating the minimum number of palantirs needed.
0 310 20 2010 770 30 1 7 15 20 50-1 -1
24
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.
#include<cstdio>#include<algorithm>#define maxx 10000using namespace std;int a[maxx],n,r;int main(){while(scanf("%d %d",&r,&n),n!=-1&&r!=-1){for(int i=0;i<n;i++) scanf("%d",&a[i]);sort(a,a+n);int i=0,ans=0;while(i<n){//找到最左边的没被覆盖的点...从这开始 int s=a[i++];while(i<n&&a[i]<=s+r) i++;//找到应该放置的点 int p=a[i-1];while(i<n&&a[i]<=p+r) i++;//接着往右找找到右边界... ans++;}printf("%d\n",ans);}return 0;}
- poj 3069 Saruman's Army(贪心)
- POJ 3069 Saruman's Army (贪心)
- POJ 3069 - Saruman's Army(贪心)
- POJ 3069 Saruman's Army (贪心)
- POJ 3069 Saruman's Army(贪心)
- POJ 3069 Saruman's Army(贪心)
- POJ 3069 Saruman's Army (贪心 )
- POJ - 3069 Saruman's Army(贪心)
- POJ:3069 Saruman's Army(贪心)
- POJ, 3069Saruman's Army(贪心)
- POJ 3069 Saruman's Army(贪心)
- 【Poj】-3069-Saruman's Army(贪心)
- POJ-3069 Saruman's Army (贪心)
- POJ 3069 Saruman's Army (贪心)
- poj 3069 Saruman's Army 贪心
- poj 3069Saruman's Army 贪心
- POJ 3069 Saruman's Army (贪心)
- POJ 3069 : Saruman\'s Army - 贪心
- [源码学习] -- yii2源码学习笔记(三) -- Component代码详解
- 免费的论文查重网站
- MSDN对链接器工具错误 LNK2019的解释
- 用jxl将mysql的数据结构导入到excel中
- 坐标转换
- POJ-3069 Saruman's Army (贪心)
- Java Bean以及xsd相互生成
- C#遍历所有文件夹处理
- 让chrome浏览器支持ajax跨域
- spring——控制反转
- linux系统之_进程及内存管理的前世今生
- 材质颜色
- 选择器之相邻兄弟选择器
- 怎样通过PDF编辑器来编辑修改PDF文件