[POJ](3258)River Hopscotch ---二分查找+贪心(查找+贪心)
来源:互联网 发布:网络授课系统 编辑:程序博客网 时间:2024/05/18 08:22
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 distance Di 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
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
Sample Input
25 5 2214112117
Sample Output
4
Hint
#include<iostream>#include<algorithm>#include<cstdio>#define INF 1000000005typedef long long LL;using namespace std;int L,n,m;long long x[100005];bool check(LL d){ int cnt=1; int now=x[0]; for(int i=1;i<=n+1;i++) { if(x[i]-now>=d) { cnt++; now=x[i]; } if(cnt>=m) return true; } return false;}void bSearch(){ LL l=0; LL r=INF; LL mid; while(r-l>1) { mid=(l+r)/2; if(check(mid)) l=mid; else r=mid; } printf("%lld\n",l);//最终满足题意时,一定是满足条件的,所以要求的d(mid)被赋给了l,那么我们输入l即可}int main(){ while(scanf("%d %d %d",&L,&n,&m)!=EOF) { for(int i=0;i<n;i++) scanf("%lld",&x[i+1]); x[0]=0; x[n+1]=L; sort(x,x+n+2); m=n+2-m; bSearch(); } return 0;}
- [POJ](3258)River Hopscotch ---二分查找+贪心(查找+贪心)
- POJ 3258 River Hopscotch(贪心+二分查找 最大化最小值)
- poj 3258 River Hopscotch(二分+贪心)
- POJ 3258-River Hopscotch(二分+贪心)
- POJ-3258-River Hopscotch(二分+贪心)
- [二分+贪心] 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 【二分查找(最大化最小值)】
- 【贪心专题】POJ 3258 River Hopscotch (最大化最小值 贪心+二分搜索)
- POJ3258 River Hopscotch(二分+贪心)
- River Hopscotch(贪心)
- poj 3258 River Hopscotch 【二分查找】(The Frog's Games 相似题)
- [POJ](2456)Aggressive cows ---二分查找+贪心(查找+贪心)
- log4j.properties
- ZIP工具类
- 2PC到3PC到Paxos到Raft到ISR
- tarjan算法应用 割点 桥 双连通分量
- Qemu-kvm的网络模式
- [POJ](3258)River Hopscotch ---二分查找+贪心(查找+贪心)
- Maven出错-Missing artifact org.apache.openejb:openejb-core:jar:4.1.0-SNAPSHOT:test
- Xlistview
- Python3之命名关键字参数
- js倒计时自动跳转
- Big Data 及 Hadoop
- spark学习-16-Spark的Map()和FlatMap()函数使用
- webstorm项目下文件夹消失
- 《简明python教程》笔记一