POJ 3069Saruman's Army
2016-04-17 16:35
274 查看
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
这一题样的是贪心算法,具体的思路是这样的:找到一个未标记的点a,往右找到离a最远的在R的距离之内的点b,将b坐上标记,然后在标记点b往右在距离R之内的点相当于被标记;
AC代码:
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
这一题样的是贪心算法,具体的思路是这样的:找到一个未标记的点a,往右找到离a最远的在R的距离之内的点b,将b坐上标记,然后在标记点b往右在距离R之内的点相当于被标记;
AC代码:
# include <cstdio> # include <cstring> # include <algorithm> using namespace std; int s[1010]; int flage[1010]; int main(){ int n, r, ans, cur, i, j, k; while(scanf("%d%d", &r, &n)!=EOF){ if(r==-1&&n==-1){ break; } ans=0; for(i=1; i<=n; i++){ scanf("%d", &s[i]); } sort(s+1, s+1+n); memset(flage, 0, sizeof(flage)); for(i=1; i<=n; i++){ if(!flage[i]){ ans++; cur=i; flage[i]=1; for(j=i+1; j<=n; j++){ if(s[i]+r>=s[j]){ cur=j; flage[j]=1; } else{ break; } } for(j=cur+1; j<=n; j++){ if(s[cur]+r>=s[j]){ flage[j]=1; } } } } printf("%d\n", ans); } return 0; }
相关文章推荐
- Android之Wifi开发
- MySql中外键约束
- 对“视觉机器学习20讲配套仿真代码”的研究心得---KNN学习
- Java Web乱码分析及解决方案
- OpenCV 课后练习-利用TrackBar实现视频的暂停与播放
- SM2算法第零篇:《SM2椭圆曲线公钥密码算法》概略
- android聊天器(仿QQ)编写第二天__服务器的搭建
- script_tool_for_linux.bash: Linux 环境下的 hosts 一键部署脚本
- Unity Panel open & close
- 职场思考--对产品经理岗位的技术思考(上)
- 职场思考--对产品经理岗位的技术思考(上)
- 求一个正整数不大于它的偶数
- InfoSphere Data Replication 11.3.3(CDC)为 Java 类配置用户出口
- 建立第一个spring boot ,就是这么简单
- Objective C类方法load和initialize的区别
- android开发笔记之虚拟机
- html图片自适应手机屏幕大小的css写法
- gulp入门小记
- linux内核分析 第八周读书笔记
- Java反射机制DOME