HDU 4004 The Frog's Games （二分）

The Frog's Games

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 5584    Accepted Submission(s): 2695

Problem 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 2225 3 311 218

 

Sample Output

411

 

Source

The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest

 

Recommend

lcy   |   We have carefully selected several similar problems for you:  4001 4007 4006 4003 4008 

题意：   一条河长L，有N个石头，问最多跳M次，求需要跳的最长距离

include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int n,m,len;int dis[510000];bool judge(int D){int s=0;int sum=0;if(dis[0]>D)return false;for(int i=0;i<=n;){if(dis[i]-s<=D){if(dis[i]-s==D||i==n){sum++;s=dis[i];}i++;}else{sum++;s=dis[i-1];if(dis[i]-s>D)return false;}}return sum<=m;}int main(){int ans,i;while(scanf("%d%d%d",&len,&n,&m)!=EOF){for(i=0;i<n;i++){scanf("%d",&dis[i]);}dis[n]=len;sort(dis,dis+n+1);int left=0;int right=len;int mid;while(right>=left){mid=(left+right)/2;if(judge(mid)){ans=mid;right=mid-1;}else{left=mid+1;}}printf("%d\n",ans);}return 0;}