hdu 4004 The Frog's Games

原创 2017年10月13日 10:36:22

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

大意,一条河长L,中间有n个石头,现在问,青蛙每次最少跳多少距离,能在m次之内跳过河。

大致思路。以0和河长L为上下界进行二分,对于每个mid,判断以这个mid作为最小步长,需要多次才能跳过河。

注意的问题。在对每个mid判断跳过河需要的步数时,如果任意两块石头之间的距离超过mid,则说明跳不过河。用last记录最后一个需要调到的石头,从0开始。当第i个石头到last的距离超过mid时,计步器cnt+1,然后把i的上一块石头标记为last。需要注意的时候,此时,应当从第i块石头开始继续往后遍历,由于for循环中i++自增了,所以此时,i应该先自减一次。

代码

#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;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU4004The Frog's Games二分!二分!

题目在此 题目大意:一只青蛙被一条宽度为L的河挡住了去路,垂直河岸有一些石头露出水面,这些石头在一条直线上。现在青蛙想要借助这些石头过河,但是最多跳m次,问青蛙最小弹跳多远。 题目分析:要求青蛙的...

hdu4004 The Frog's Games 二分查找+贪心 TWT Tokyo Olympic 1COMBO-2

The Frog's Games Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) ...
  • kyoma
  • kyoma
  • 2016-09-19 16:06
  • 204

HDU 4004 The Frog's Games(二分)

The Frog's Games Time Limit:1000MS     Memory Limit:65768KB     64bit IO Format:%I64d & %...

HDU 4004 The Frog's Games

The Frog's Games Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Othe...

HDU:4004 The Frog's Games(二分)

The Frog's Games Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others...

HDU 4004 The Frog's Games(二分)

Problem Description The annual Games in frogs' kingdom started again. The most famous game is the I...

HDU 4004 The Frog's Games(2011年大连网络赛 D 二分+贪心)

其实这个题呢,大白书上面有经典解法 题意是青蛙要跳过长为L的河,河上有n块石头,青蛙最多只能跳m次且只能跳到石头或者对面。问你青蛙可以跳的最远距离的最小值是多大典型的最大值最小化问题,解法就是贪心二...

The Frog's Games HDU - 4004 (二分)

The annual Games in frogs' kingdom started again. The most famous game is the Ironfrog Triathlon. On...

HDU 4004 The Frog's Games

题意:有一条河长L,中间有n个石头,一只青蛙想跳过去,它最多只能跳m次。它该如何跳,才能跳到对岸,求青蛙最小的跳跃能力。 思路:青蛙的最小跳跃力,实际上就是所有跳跃中的最大距离。这里也就是求青蛙最大...

hdu 4004 The Frog's Games

The Frog's Games Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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