Saruman's Army(POJ 3069)
2016-09-02 19:16
323 查看
C - Saruman's Army
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu
Submit Status Practice POJ
3069
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
Sample Output
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.
FAQ | About | Google Group | Discuss | Author
All Copyright Reserved ©2010-2016 HUST ACM/ICPC TEAM
Server Time: 2016-09-02 19:14:09 GMT+8
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu
Submit Status Practice POJ
3069
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.
FAQ | About | Google Group | Discuss | Author
All Copyright Reserved ©2010-2016 HUST ACM/ICPC TEAM
Server Time: 2016-09-02 19:14:09 GMT+8
#include<stdio.h> #include<iostream> #include<algorithm> using namespace std; int x[1001]; int main() { int r,n; while(scanf("%d%d",&r,&n)&&(r!=-1&&n!=-1)) { for(int i=0;i<n;i++) scanf("%d",&x[i]); sort(x,x+n); int i=0,ans=0; while(i<n) { int s=x[i++]; while(i<n&&x[i]<=s+r)//一直向右找距离s大于r的点 i++; int p=x[i-1];//p为新标记的点 while(i<n&&x[i]<=p+r) i++; ans++; } printf("%d\n",ans); } }
相关文章推荐
- D - Saruman's Army POJ - 3069
- POJ3069——Saruman's Army
- POJ:3069 Saruman's Army(贪心)
- 【简单贪心】POJ 3069-Saruman's Army
- 【原创】【区间上的贪心 第三篇】Saruman's Army POJ 3069
- POJ——3069 Saruman's Army
- POJ 3069 Saruman's Army
- poj 3069 Saruman's Army
- Saruman's Army POJ - 3069【模拟+贪心】
- poj 3069 Saruman's Army【贪心】
- Saruman's Army (POJ 3069)
- POJ 3069 Saruman's Army 贪心
- poj 3069 Saruman's Army
- POJ 3069 Saruman's Army(贪心)
- poj 3069 Saruman' Army
- poj 3069 Saruman's Army
- POJ 3069 Saruman's Army [贪心]
- POJ 3069 Saruman's Army
- POJ 3069 Saruman's Army(贪心+区间覆盖)
- poj 3069 Saruman's Army