River Hopscotch解题报告

原创 2012年03月25日 20:15:16

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 toM rocks (0 ≤ MN).

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

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 removingM 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).
 
数轴上有n个石子,第i个石头的坐标为Di,现在要从0跳到L,每次条都从一个石子跳到相邻的下一个石子。
现在FJ允许你移走M个石子,问移走这M个石子后,相邻两个石子距离的最小值的最大值是多少。
#include<iostream>
 #include<algorithm>
 using namespace std;
 int main(void)
 {
     int L,n,m;   
     while(cin>>L>>n>>m)
     {
         int* dist=new int[n+2];  //新的定义数组的方法。
         dist[0]=0;    
         dist[n+1]=L;  
         int low=L,high=L;          
         for(int i=1;i<=n+1;i++)
         {
             if(i<=n)     //n+1不用输入。
                 cin>>dist[i];
             if(low > dist[i]-dist[i-1]) //找出最小差值。
                 low=dist[i]-dist[i-1];
         }
         sort(dist,dist+(n+2));     //排序。     
         while(low<=high)    //查找的x在(low,high)中,不断逼近。
         {
             int mid=(low+high)/2,delrock=0,sum=0;  
             for(int i=1;i<=n+1;)
             {
                 if( (sum+=(dist[i]-dist[i-1]))<=mid) //可能两石头间(《mid。且有几块石头)可移动sum个都满足。
                 {
                     i++;
                     delrock++;  //移动一块石头++;
                 }
                 else   //不满足就是起点往后移。
                 {
                     i++;
                     sum=0;  
                 }
             }
             if(delrock<=m)    //移动的石头<m,增大mid.
                 low=mid+1;   
             else             //减少mid。
                 high=mid-1;  
         }        
      cout<<low<<endl;
      delete dist;  //释放dist。
     }
     return 0;
 }


 

POJ 3258 River Hopscotch (二分经典)

River Hopscotch Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 10591   Accepted:...
  • yao1373446012
  • yao1373446012
  • 2016年06月03日 07:33
  • 335

【二分法】POJ3258-River Hopscotch

【抱大腿】啊啊啊又是一道恶心的题目!!!这道题是出在二分法里面的,因为这跟前面的一道青蛙过河的题特别像但是不一样,按照青蛙过河那个思路来走根本行不通,正好要按照跟那个思路相反的想法来想才行~ ...
  • silent0001
  • silent0001
  • 2016年07月27日 14:53
  • 251

POJ - 3258 River Hopscotch 二分

题目大意:给出河的宽度L和N块石头,现在要求移除M块石头,使得石头间的距离的最小值达到最大(起点和终点都有一块石头,但这两块石头不能移除)解题思路:最小值的最大值,肯定用二分了 如果存在最优的距离,...
  • L123012013048
  • L123012013048
  • 2015年05月11日 18:22
  • 832

POJ 3258 River Hopscotch(二分)

River Hopscotch Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 8975  ...
  • yeguxin
  • yeguxin
  • 2015年07月25日 14:34
  • 580

River Hopscotch(贪心)

River Hopscotch Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit...
  • liangzhaoyang1
  • liangzhaoyang1
  • 2016年03月13日 17:01
  • 569

【POJ 3258】 River Hopscotch (二分)

【POJ 3258】 River Hopscotch 一窝牛要过河 河宽l 河中有n个许多石块 每个对应与牛所在的岸边有个距离 现在想要去掉m个石块后最小距离最大 问怎么去 二分最小值最大化 ...
  • ChallengerRumble
  • ChallengerRumble
  • 2015年08月23日 20:14
  • 714

poj 3258 River Hopscotch(二分+贪心)

题意: 。。。 思路: 贪心check: 因为首尾是不能动的,所以从第二个点开始check,看它与前面的点距离是否满足条件,不满足就将它删除。int check(int limi) { ...
  • slowlight93
  • slowlight93
  • 2015年03月03日 16:43
  • 352

River Hopscotch(二分最大值)

Description Every year the cows hold an event featuring a peculiar version of hopscotch that involv...
  • Techay
  • Techay
  • 2016年02月26日 11:17
  • 146

POJ3258-River Hopscotch-二分+贪心【最小值最大化】

给你L,n,m L是一条路总长度 n是路上n个石头 m是要移走m个石头(第一个和最后一个石头不能移走)   设X为剩下的n-m个石头里,石头之间相邻最近的距离 求这个X的最大值 二分X,对于...
  • viphong
  • viphong
  • 2016年02月27日 11:15
  • 197

hrbust 1006 River Hopscotch【二分查找】好题

River Hopscotch Time Limit: 2000 MS Memory Limit: 65536 K Total Submit: 253(111 users) T...
  • mengxiang000000
  • mengxiang000000
  • 2016年07月05日 13:33
  • 517
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:River Hopscotch解题报告
举报原因:
原因补充:

(最多只允许输入30个字)