POJ3069 Saruman's Army
来源:互联网 发布:windows内核 编辑:程序博客网 时间:2024/05/22 06:16
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
#include <stdio.h>#include <algorithm>using namespace std;#define maxn 1010int arr[maxn];int main() {int R, N, i, ans, pos;while(scanf("%d%d", &R, &N), N > 0) {for(i = 0; i < N; ++i)scanf("%d", &arr[i]);sort(arr, arr + N);N = unique(arr, arr + N) - arr;ans = pos = i = 0;while(i < N) {pos = arr[i++]; // 最左未覆盖点while(i < N && arr[i] - pos <= R) ++i;pos = arr[i-1]; ++ans; // 选择该点while(i < N && arr[i] - pos <= R) ++i;}printf("%d\n", ans);}return 0;}
- poj3069 Saruman's Army
- POJ3069 Saruman's Army
- POJ3069 Saruman's Army
- POJ3069-Saruman`s Army
- POJ3069 Saruman's Army
- POJ3069 Saruman's Army
- poj3069 Saruman's Army
- poj3069 Saruman's Army
- POJ3069 Saruman's Army
- Saruman's Army POJ3069
- poj3069 Saruman's Army(贪心)
- POJ3069 Saruman's Army(贪心)
- poj3069 Saruman's Army 贪心
- POJ3069 Saruman's Army【贪心】
- poj3069 Saruman's Army 贪心
- POJ3069 Saruman's Army (贪心)
- POJ3069-贪心-Saruman's Army
- POJ3069---Saruman's Army()
- Oracle 10g复合数据类型pl/sql集合学习六——索引表、嵌套表、变长数组
- Oracle 10g数据库游标的使用学习一
- Oracle 10g使用游标更新或删除数据
- Oracle 10g如何对用户姓名,按首字母排序、查询
- qt下OpenCV编程例子笔记一
- POJ3069 Saruman's Army
- Oracle 10g处理例外(即sql异常)学习一——预定义例外,即常见例外
- Oracle 10g处理例外(即sql异常)学习二——自定义例外和非预定义例外
- PHP中spl_autoload_register函数的用法
- 利用windows自带任务计划功能自动备份项目产生的文件
- 关于TreeSet的排序问题
- Oracle 10g存储过程学习一
- Oracle 10g存储过程学习二——为参数传递变量和数据
- Oracle 10g创建函数——带输入、输出参数