POJ 3069 Saruman's Army
来源:互联网 发布:西安高新广电网络 编辑:程序博客网 时间:2024/06/06 05:24
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 310 20 2010 770 30 1 7 15 20 50-1 -1
Sample Output
24
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
////20150110#include<iostream>#include<algorithm>using namespace std;#define MAX_N 1001int x[MAX_N];int R,n;void solve(){sort(x,x+n);int i=0,ans=0;while(i<n){int s=x[i++];//未被覆盖的最左的点 while(i<n&&x[i]<=s+R) i++;//向右扫描直到离未被覆盖点超过R int p=x[i-1];while(i<n&&x[i]<=p+R) i++;//当前覆盖点往右R的距离 ans++;}cout<<ans<<endl;}int main(){while(cin>>R>>n){if(R==-1&&n==-1)break;for(int i=0;i<n;i++){cin>>x[i];}solve();}}
- 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 3069 Saruman‘s Army
- POJ 3069 Saruman's Army
- POJ 3069 Saruman's Army
- poj 3069 Saruman's Army
- POJ Saruman's Army 3069
- POJ 3069 Saruman's Army
- POJ-3069 Saruman's Army
- POJ 3069 Saruman's Army
- POJ 3069 Saruman's Army
- 2014年12月4日星期四(DEMO10-2地形生成函数)
- 图片加载利器Picasso 解析
- 创建一个单文档MFC应用程序的那些事儿
- ubuntu命令行连接WIFI
- IOS之c语言笔记 day03
- POJ 3069 Saruman's Army
- 自定义数据库中使用 contentObserver
- OJ解题总结
- 2016年1月2日,参加第三个项目(6745小时)
- 常规功能和模块自定义系统 (cfcmms)—030开发日志(创建ManyToMany的column5)
- 编码问题 题解
- 字符串的比较
- 最小伤害 题解
- 全排列 (codevs 1294)题解