poj3258River Hopscotch
来源:互联网 发布:彗星dns优化 编辑:程序博客网 时间:2024/05/17 01:33
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 Mrocks (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 ofM 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
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).
一条河宽为L,河中有n块石头,并且每块石头距河岸的距离已知,现在将河中的m块石头移去,求相邻两块石头的最小距离的最大值
代码如下:
#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;int num[50500];int i,n,m,l,mid,ant;bool judge(int mid){int sum=0,k=0;for(i=1;i<=n+1;i++){if(num[i]-num[k]<mid){sum++;}else k=i;}return sum<=m;}int main(){while(scanf("%d%d%d",&l,&n,&m)!=EOF){for(i=1;i<=n;i++)scanf("%d",&num[i]);num[0]=0;num[n+1]=l;sort(num,num+n+2);int lb,lu;lb=num[0],lu=l;while(lb<=lu){mid=(lb+lu)/2;if(judge(mid)){lb=mid+1;ant=mid;}elselu=mid-1;}printf("%d\n",ant);}}
- POJ3258River Hopscotch
- poj3258River Hopscotch
- poj3258River Hopscotch(二分)
- poj3258River Hopscotch【二分】
- poj3258River Hopscotch(二分)
- Hopscotch
- Hopscotch
- Hopscotch
- * Hopscotch
- Hopscotch
- Hopscotch
- Hopscotch
- POJ3050 Hopscotch
- POJ3050--Hopscotch
- River Hopscotch
- POJ3050-Hopscotch
- River Hopscotch
- Hopscotch POJ3050
- win10 64位安装genism
- 山东理工OJ 1243 母牛的故事
- EasyUI 拖放
- LA 3704 Cellular Automaton【循环矩阵,快速幂】
- C ++ 虚函数 (转)
- poj3258River Hopscotch
- HDU 3366 Passage
- c++实现图像旋转任意角度
- POJ 1083 Moving Tables
- CodeIgniter框架源码笔记(9)——日志记录类Log.php
- 策略模式
- nyoj 17 单调递增最长子序列
- Android textview实现局部点击
- Js基础学习之-- 利用GET方法实现ajax请求