Saruman's Army
来源:互联网 发布:狗钙片哪个牌子好 知乎 编辑:程序博客网 时间:2024/06/06 01:52
3069:Saruman’s Army
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 11292 Accepted: 5710
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
Stanford Local 2006
#include<iostream>#include<algorithm>using namespace std;//http://poj.org/problem?id=3069//贪心法,做题之前要想清楚思路再做 int r,n,a[1100];int main(){ while(cin>>r>>n){ if(r==-1&&n==-1)break; int res=0; for(int i=0;i<n;i++){ cin>>a[i]; } sort(a,a+n); int k=0;//k用于向右找点的位置 while(k<n){ int s=a[k++];//s是没有被覆盖的最左边的点 while(k<n&&a[k]<=s+r)k++; //一直向右前进知道距离s距离大于r的点 int p=a[k-1];//p是新标记上的点的位置 while(k<n&&a[k]<=p+r)k++; res++; } cout<<res<<endl; }}
- poj Saruman's Army
- Saruman's Army
- Saruman's Army
- poj3069 Saruman's Army
- Saruman's Army
- POJ3069 Saruman's Army
- Saruman's Army
- POJ3069 Saruman's Army
- POJ3069-Saruman`s Army
- Saruman's Army
- C - Saruman's Army
- POJ3069 Saruman's Army
- POJ3069 Saruman's Army
- poj3069 Saruman's Army
- Saruman's Army POJ
- Saruman's Army POJ
- Saruman's Army POJ
- Saruman's Army POJ
- 真Unity3d_场景开发_Probuilder入门
- Spark日志分析项目Demo(7)--临时表查询,各区域top3热门商品统计
- The required Server component failed to start so Tomcat is unable to start.
- loadrunner Web_类函数之web_cleanup_auto_headers()和web_cleanup_cookies()
- 数学建模专栏 | 第十篇:MATLAB CUMCM真题求解实例一:数据型
- Saruman's Army
- 2017秋季 超星尔雅舌尖上的植物学答案
- SpringCloud Config-----1、搭建分布式配置中心
- Java环境配置--只需一步
- C++关于map的插入 删除
- 关于一道编程题,重拾起编程
- fckEditor的使用以及图片上传不显示解决
- 4.35 leetcode -35 binary-tree-inorder-traversal
- 饿了么,美团外卖用一台打印机自动接单打印外卖订单小票(教程)