poj 3069 Saruman's Army
来源:互联网 发布:个人卖数据 编辑:程序博客网 时间:2024/06/06 15:46
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
/*Problem: 3069User: moteflyMemory: 668KTime: 16MSLanguage: G++Result: Accepted*/#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;void solve();const int maxn=1005;int r,n,p[maxn];int main(){ while(scanf("%d%d",&r,&n)&&r!=-1&&n!=-1) { for(int i=0;i<n;i++) scanf("%d",&p[i]); sort(p,p+n); int i=0,ans=0; while(i<n) { int s=p[i++]; while(i<n&&p[i]<=s+r) i++; int x=p[i-1]; while(i<n&&p[i]<=x+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 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
- 麻省理工算法导论公开课(1)
- 二:5.配置Varnish支持多个后端域名
- hide特效
- 图片缩放旋转
- Unix/Dos 文本文件格式
- poj 3069 Saruman's Army
- 求幂,全排列基本算法
- linux多线程pthread
- 数学之美系列二十:自然语言处理的教父 马库斯
- 深入函数
- Bash快捷键和终端使用vi快捷键方法
- MySQL在大型网站的应用架构演变
- 不打无准备之仗
- android 基础 1.1 button