The Frog's Games
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 5576 Accepted Submission(s): 2692
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).
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.
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
Source
Recommend
lcy
题意:青蛙过河,中间有石头,青蛙可以通过跳石头来过河。给定石头距出发的岸的距离和青蛙可以跳的次数,求出青蛙的最小跳跃能力(在指定跳数之内到达另一个岸)
思路:用二分扫,在给定mid时,每次青蛙都跳到最远的自己能到达的石头(贪心)。
注意:l和r的初始化。
#include <stdio.h>
#include <algorithm>
using namespace std;
int a[500010];
int L,n,m;
int judge(int x)
{
int pos=0;//落脚点
int cnt=0;
for(int i=1;i<=n;i++)
{
if(a[i]-a[pos]<=x&&a[i+1]-a[pos]>x)//判断出可以跳到的点
{
pos=i;
cnt++;
}
}
cnt++;//比如中间俩落脚点,则跳3次,所以+1
if(cnt<=m)
{
return 1;
}
else
{
return 0;
}
}
int main()
{
while(scanf("%d%d%d",&L,&n,&m)!=EOF)
{
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
a[0]=0;
a[n+1]=L;
sort(&a[1],&a[n+1]);
int max=0;
for(int i=1;i<=n+1;i++)
{
if(a[i]-a[i-1]>max)
max=a[i]-a[i-1];
}
int l=max,r=L,mid,ans;//l不能从0开始,从max开始。。
while(r>=l)
{
mid=(l+r)/2;
if(judge(mid))
{
ans=mid;
r=mid-1;
}
else
{
l=mid+1;
}
}
printf("%d\n",ans);
}
return 0;
}