Saruman's Army-贪心选择
来源:互联网 发布:ant java参数 编辑:程序博客网 时间:2024/05/29 17:38
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.
//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.//上面的意思是 没有60这个点就不能在60上标记(如果有60这个点则是可以覆盖的) ,如果在0这个点则覆盖范围为[-R,R] //#include <bits/stdc++.h>#include <iostream>#include <cstdio>#include <algorithm>using namespace std;const int N=1005;int r,n,x[N],cnt;int main(){while(scanf("%d %d",&r,&n)&&(r!=-1&&n!=-1)){cnt=0;for(int i=1;i<=n;i++)cin>>x[i];sort(x+1,x+1+n);//排序 int i=1;//从下标1开始 while(i<=n){int s=x[i++];while(i<=n&&x[i]<=s+r)//一直向右前进直到据s的距离大于r的点 i++;int p=x[i-1];while(i<=n&&x[i]<=p+r)//一直向右前进直到据p的距离大于r的点 i++;cnt++;}cout<<cnt<<endl;}return 0;}
- Saruman's Army-贪心选择
- Saruman's Army 贪心
- Saruman's Army 贪心 POJ
- Saruman's Army ----- 贪心法
- poj3069 Saruman's Army(贪心)
- 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 (贪心)
- poj 3069 Saruman's Army 贪心
- POJ - Saruman's Army(贪心)
- poj 3069Saruman's Army 贪心
- poj 3069 Saruman's Army(贪心)
- poj 2376-Saruman's Army 贪心算法
- 通向架构师的道路(第一天)之Apache整合Tomcat
- 机器学习入门和资源整合
- DWR+SpringMVC整合的3种方式之三
- fcntl函数
- iOS路由跳转(一)之初识URL
- Saruman's Army-贪心选择
- Java基本数据类型
- 工业机器人的控制算法
- 使用LVS+keepalived实现mysql负载均衡的实践和总结
- Visual Studio 2013开启Web项目报 System.AccessViolationException 错的解决方法
- 引用和函数重载
- POJ2785-Values whose Sum is 0
- 练习
- ubuntu pycuda安装