HDOJ 4004 The Frog's Games

The Frog's Games

Time Limit:1000MS     Memory Limit:65768KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

The annual Games in frogs' kingdom started again. The most famous game is the Ironfrog Triathlon. One test in the Ironfrog Triathlon is jumping. This project requires the frog athletes to jump over the river. The width of the river is L (1<= L <= 1000000000). There are n (0<= n <= 500000) stones lined up in a straight line from one side to the other side of the river. The frogs can only jump through the river, but they can land on the stones. If they fall into the river, they 
are out. The frogs was asked to jump at most m (1<= m <= n+1) times. Now the frogs want to know if they want to jump across the river, at least what ability should they have. (That is the frog's longest jump distance).

 

Input

The input contains several cases. The first line of each case contains three positive integer L, n, and m. 
Then n lines follow. Each stands for the distance from the starting banks to the nth stone, two stone appear in one place is impossible.

 

Output

For each case, output a integer standing for the frog's ability at least they should have.

 

Sample Input

        
        

         
         6 1 2
2
25 3 3
11 
2
18 
        
        

 

Sample Output

        
        

         
         4
11 
        
        
        
        

         
         
此题为最大距离最小化，用二分；求出满足要求的值中最小的那个；
        
        
        
        


        
        

代码：

#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
int d[500010]; 
int L,n,m;
bool judge(int mid)
{
	int cnt=0;//记录每次情况下跳的次数 
	int last=0;//记录上次跳的位置； 
	for(int i=1;i<=n+1;)
	{
		if(d[i]<=last+mid)
		{
			i++;//继续往后走，直到找到距离能跳的位置最近的左边的石头 ； 
		}
		else
		{
			if(last==d[i-1])//假如每次都在同一个石头，说明跳不过去； 
			   return false;
			last=d[i-1];
			cnt++;
		}
	}
	cnt++;
	return cnt<=m;
 } 
int main()
{
	
	while(scanf("%d%d%d",&L,&n,&m)!=EOF)
	{
		int ans=0;
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&d[i]);
		} 
		d[n+1]=L;
		sort(d+1,d+1+n);
		int l=1,r=L;
		while(l<=r) 
		{
			int mid=(l+r)/2;
			if(judge(mid))
			{
				ans=mid;
				r=mid-1;//继续往左找，直到找到最小的 （取左边区间）；
			} 
			else
			{
				l=mid+1;
			}
		}
		printf("%d\n",ans);
	} 
	return 0;
}