POJ3069 贪心法 覆盖问题
来源:互联网 发布:java链表面试题 编辑:程序博客网 时间:2024/06/09 12:37
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
遇到的问题和解决思路:
个人感觉,这道题如果没有先看过书再写的话,肯定不会想到这个是贪心法,而且也不好描述。因为要同时左右都考虑到,所以要既考虑到右边,也考虑到左边。
具体的解决思路就看代码吧,虽然AC了,不过自己编写还是和书上有点不一样的。(挑战p46)
给出代码:
#include<cstdio>#include<algorithm>#include<cstring>#include<cmath>using namespace std;int r,n;int di[1005];void solve(){int res = 0;sort(di ,di + n);for(int i = 0;i < n; i++){int a = di[i];while(a + r >= di[i] && i < n) i++;a = di[--i];//书上这里是 a = di[i-1];while(a + r >= di[i] && i < n)i++;//感觉这一步的i<n绝对不能少,不然超出范围了,di[i]就是随机的一个数字了res++;i--;//书上没有这一步。之所以这一步和书上有区别,是因为书上用的是while(i<n),然而我这里用的是i++}printf("%d\n",res);}int main(){while(scanf("%d%d",&r,&n)!=EOF){if(r == -1 && n == -1)break;memset(di , 0 ,sizeof(di));for(int i = 0;i < n ; i++)scanf("%d",&di[i]);solve();}return 0;}
- POJ3069 贪心法 覆盖问题
- 贪心--poj3069
- POJ3069(贪心)
- poj3069贪心
- poj3069 贪心
- poj3069(贪心)
- poj3069贪心
- 贪心POJ3069
- poj3069贪心
- poj3069贪心、思想、技巧
- poj3069(贪心)
- poj3069简单贪心
- poj3069【贪心,水】
- POJ3069-贪心水
- POJ3069(贪心)
- poj3069(贪心)
- POJ3069左右点贪心 贪心
- 贪心法——区间覆盖问题
- CF 617E 莫队
- netstat
- Hadoop Shell命令
- mysql基础语句
- java面向对象
- POJ3069 贪心法 覆盖问题
- 编译完py后,pyc 和pyo文件是干嘛的?
- 如何打造一个让人愉快的框架
- JDBC
- iptables ---允许端口通过
- 数据结构实现之Table(符号表,内部存储key-value对)
- 微信JS-SDK说明文档
- SDWedImage
- 使用WakeLock使Android应用程序保持后台唤醒