# hdu 4004 The Frog's Games

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<algorithm>
using namespace std;

int l,n,m;
int a[50009];

bool fun(int mid)
{
int cnt=0,last=0;
for(int i=1;i<=n+1;i++)
{
if(a[i]-a[i-1]>mid)
return false;
else
{
if(a[i]-a[last]<=mid)
continue;
else
{
cnt++;
last=--i;
}
}
}
cnt++;
if(cnt<=m) return true;
else return false;
}

int main()
{
while(~scanf("%d%d%d",&l,&n,&m))
{
a[0]=0;
for(int i=1;i<n+1;i++)
scanf("%d",&a[i]);
a[n+1]=l;
sort(a+1,a+1+n);
int le=0,ri=l,mid;
while(le<=ri)
{
mid=(le+ri)/2;
if(fun(mid))
ri=mid-1;
else
le=mid+1;
}
printf("%d\n",le);
}
return 0;
}

• 本文已收录于以下专栏：

## 杭电 4004 The Frog's Games

The Frog's Games Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others...
• u014688855
• 2014年04月13日 21:41
• 1040

## hdu4004The Frog's Games

• u014303647
• 2014年05月11日 15:08
• 1169

## hdoj4004The Frog's Games【二分】

The Frog's Games Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others...
• R1986799047
• 2015年08月26日 00:35
• 341

## HDU 4004 The Frog's Games（基本算法-贪心,搜索-二分）

HDU 4004 The Frog's Games（基本算法-贪心,搜索-二分） 题目大意： 长为L的河流，中间有n个石头，告诉你石头的位置，青蛙的跳跃能力至少为多少中途跳m次能跳过去？ 解题思路...
• a1061747415
• 2014年08月03日 22:15
• 979

## HDU 2199 -- The Frog's Games

• u011346442
• 2015年04月14日 20:16
• 249

## The Frog’s Games(hdu 4004)

http://acm.hdu.edu.cn/showproblem.php?pid=4004 汗！二分。 #include #include #define MAX 500005 usi...
• ymmqwe
• 2014年03月13日 14:14
• 357

## hdu 4004 - The Frog's Games

• mobius_strip
• 2014年09月18日 15:25
• 698

## hdu 4004 The Frog's Games

http://acm.hdu.edu.cn/showproblem.php?pid=4004 分析：二分查找+贪心（哎） #include #include #include using name...
• yduqytd
• 2013年08月22日 20:17
• 378

## HDU 4004 The Frog's Games

﻿﻿ http://acm.hdu.edu.cn/showproblem.php?pid=4004 之前做了个题
• Unin88
• 2014年09月23日 15:59
• 248

## HDU 4004 The Frog's Games

/* -------------------------------------------------------------- stratege : 二分查找 + 贪心 time ...
• zone_programming
• 2012年02月08日 21:25
• 926

举报原因： 您举报文章：hdu 4004 The Frog's Games 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)