poj3069(贪心)
2016-05-16 19:20
309 查看
Saruman’s Army
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 6900 Accepted: 3553
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
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.
贪心
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 6900 Accepted: 3553
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
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.
贪心
#include<iostream> using namespace std; #include<vector> #include<algorithm> #include<cstdio> vector<int> v; int main(){ int r,n; while(scanf("%d%d",&r,&n),r+n>0){ v.clear(); for(int i=0;i<n;++i){ int num; scanf("%d",&num); v.push_back(num); } sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); int ans=0; int len=v.size(); int i=0; int coun=0; while(i<len){ int j=i; while(j<len&&v[j]-v[i]<=r){ ++j; } int k=j-1; while(k<len&&v[k]-v[j-1]<=r){ ++k; } ++ans; i=k; } cout<<ans<<endl; } return 0; }
相关文章推荐
- i++与++i
- UVA - 10815 Andy's First Dictionary
- bzoj3571: [Hnoi2014]画框
- Caused by: org.apache.ibatis.exceptions.TooManyResultsException: Expected one result (or null) to be
- 博客菜鸟驾到
- 仿网易新闻导航栏PagerSlidingTabStrip源码分析
- 光照模型
- UVA100
- Android学习笔记十五:wifi连接,获取名字,IP地址
- 乱码问题
- TextView整理
- getSession getHibernateTemplate用哪个?
- MSSQL之六 数据库设计
- MSSQL之六 数据库设计
- 异常处理注意点
- bzoj 3571: [Hnoi2014]画框 最优乘积匹配
- MSSQL之六 数据库设计
- Linux 安装svn
- 计算机网络(原书第六版) 第二章笔记
- 【网络】TCP协议