Poj3258 River Hopscotch 二分
2017-04-03 21:46
387 查看
River Hopscotch
Description
Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a rock at the start and another rock at the end, L units
away from the start (1 ≤ L ≤ 1,000,000,000). Along the river between the starting and ending rocks, N (0 ≤ N ≤ 50,000) more rocks appear, each at an integral distanceDi from the start (0 < Di < L).
To play the game, each cow in turn starts at the starting rock and tries to reach the finish at the ending rock, jumping only from rock to rock. Of course, less agile cows never make it to the final rock, ending up instead in the river.
Farmer John is proud of his cows and watches this event each year. But as time goes by, he tires of watching the timid cows of the other farmers limp across the short distances between rocks placed too closely together. He plans to remove several rocks in
order to increase the shortest distance a cow will have to jump to reach the end. He knows he cannot remove the starting and ending rocks, but he calculates that he has enough resources to remove up to M rocks (0 ≤ M ≤ N).
FJ wants to know exactly how much he can increase the shortest distance *before* he starts removing the rocks. Help Farmer John determine the greatest possible shortest distance a cow has to jump after removing the optimal set of M rocks.
Input
Line 1: Three space-separated integers: L, N, and M
Lines 2..N+1: Each line contains a single integer indicating how far some rock is away from the starting rock. No two rocks share the same position.
Output
Line 1: A single integer that is the maximum of the shortest distance a cow has to jump after removing M rocks
Sample Input
Sample Output
Hint
Before removing any rocks, the shortest jump was a jump of 2 from 0 (the start) to 2. After removing the rocks at 2 and 14, the shortest required jump is a jump of 4 (from 17 to 21 or from 21 to 25).
Source
USACO 2006 December Silver
思路:
先将石头到起点的距离按升序排序,再二分最短距离。判断方法是贪心,只要距离小于最小距离则s++,判断s是否大于m。
注意:
1、判断时要加上石头的终点。
2、判断时要注意当某一最小距离x时,还存在有等于x的距离,x仍是最小距离。见下例子:
28 29 4
4
5
7
9
12
16
19
23
26
答案是3不是2。
代码:
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int d,n,m;
int a[50005]={0};
bool judge(int x){
int s=0;
int y=0;
for(int i=1;i<=n;i++){
if(a[i]-y<=x){
s++;
}else{
y=a[i];
}
}
return s<=m;
}
int main(){
scanf("%d%d%d",&d,&n,&m);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
n++;
a
=d;
sort(a+1,a+n+1);
int l=0,r=d,mid;
while(l+1<r){
mid=(l+r)/2;
if(judge(mid)){
l=mid;
}else{
r=mid;
}
}
printf("%d",r);
return 0;
}
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 13071 | Accepted: 5597 |
Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a rock at the start and another rock at the end, L units
away from the start (1 ≤ L ≤ 1,000,000,000). Along the river between the starting and ending rocks, N (0 ≤ N ≤ 50,000) more rocks appear, each at an integral distanceDi from the start (0 < Di < L).
To play the game, each cow in turn starts at the starting rock and tries to reach the finish at the ending rock, jumping only from rock to rock. Of course, less agile cows never make it to the final rock, ending up instead in the river.
Farmer John is proud of his cows and watches this event each year. But as time goes by, he tires of watching the timid cows of the other farmers limp across the short distances between rocks placed too closely together. He plans to remove several rocks in
order to increase the shortest distance a cow will have to jump to reach the end. He knows he cannot remove the starting and ending rocks, but he calculates that he has enough resources to remove up to M rocks (0 ≤ M ≤ N).
FJ wants to know exactly how much he can increase the shortest distance *before* he starts removing the rocks. Help Farmer John determine the greatest possible shortest distance a cow has to jump after removing the optimal set of M rocks.
Input
Line 1: Three space-separated integers: L, N, and M
Lines 2..N+1: Each line contains a single integer indicating how far some rock is away from the starting rock. No two rocks share the same position.
Output
Line 1: A single integer that is the maximum of the shortest distance a cow has to jump after removing M rocks
Sample Input
25 5 2 2 14 11 21 17
Sample Output
4
Hint
Before removing any rocks, the shortest jump was a jump of 2 from 0 (the start) to 2. After removing the rocks at 2 and 14, the shortest required jump is a jump of 4 (from 17 to 21 or from 21 to 25).
Source
USACO 2006 December Silver
思路:
先将石头到起点的距离按升序排序,再二分最短距离。判断方法是贪心,只要距离小于最小距离则s++,判断s是否大于m。
注意:
1、判断时要加上石头的终点。
2、判断时要注意当某一最小距离x时,还存在有等于x的距离,x仍是最小距离。见下例子:
28 29 4
4
5
7
9
12
16
19
23
26
答案是3不是2。
代码:
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int d,n,m;
int a[50005]={0};
bool judge(int x){
int s=0;
int y=0;
for(int i=1;i<=n;i++){
if(a[i]-y<=x){
s++;
}else{
y=a[i];
}
}
return s<=m;
}
int main(){
scanf("%d%d%d",&d,&n,&m);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
n++;
a
=d;
sort(a+1,a+n+1);
int l=0,r=d,mid;
while(l+1<r){
mid=(l+r)/2;
if(judge(mid)){
l=mid;
}else{
r=mid;
}
}
printf("%d",r);
return 0;
}
相关文章推荐
- poj 3258 River Hopscotch 【二分】
- poj 3258:River Hopscotch(二分)
- poj-3258-River Hopscotch-二分
- POJ_3258_River Hopscotch_二分搜索
- POJ-3258 River Hopscotch 二分枚举求上限
- River Hopscotch - POJ 3258 二分
- poj 3258 River Hopscotch 二分查找
- poj 3258 River Hopscotch 二分搜索极值
- River Hopscotch POJ - 3258 (二分求最小值)
- POJ 3258:River Hopscotch 二分的好想法
- POJ 3258 River Hopscotch 二分
- River Hopscotch POJ - 3258 (二分求最小值)
- poj 3258 River Hopscotch 二分搜索
- POJ 3258 River Hopscotch 二分答案
- POJ 3258:River Hopscotch 二分的好想法
- POJ 3258 River Hopscotch<二分>
- River Hopscotch POJ - 3258 (二分求最小值)
- POJ 3258 River Hopscotch 二分
- POJ 3258 River Hopscotch 二分
- POJ - 3258/USACO - Dec06 Silver/NOIP 2015 - 提高组 River Hopscotch 贪心+二分搜索