hdu 4004

最新推荐文章于 2019-07-17 06:37:36 发布

小黑妹

最新推荐文章于 2019-07-17 06:37:36 发布

阅读量740

点赞数 1

分类专栏：二分文章标签： distance integer each input 64bit output

本文链接：https://blog.csdn.net/hellobabygogo3/article/details/7993447

版权

二分专栏收录该内容

5 篇文章 0 订阅

订阅专栏

题意：在青蛙的世界里有一项竞赛，要求青蛙在给定的跳跃次数M 以内跳过河。我们预先知道河宽L，河上有N块石头，青蛙可以在石头上停留。求青蛙的每次跳跃至少跳多远才能顺利过河。
题解：当青蛙跳长等于河宽L时它一定能跳过河。那么通过二分跳长，求出能过河的最短跳长。

开始的时候不知道怎么解，后来看了别人的结题报告突然觉得这题好简单啊，就是方法很难想到。

E - The Frog's Games

Crawling in process...Crawling failedTime Limit:1000MS Memory Limit:65768KB64bit 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

代码：

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int stone[500005];
int len,n,m;
bool ok(int num)
{
     if(num*m<len) return false;
     int i=1,j=0,cnt=0;
     while(i<=n+1)
     {
       cnt++;
       if(num<stone[i]-stone[j]) return false;
       while(num>=stone[i]-stone[j]&&i<=n+1){i++;}
       j=i-1;
     }
     if(cnt>m) return false;
     else return true;
}
       
int main()
{
  int i,j,k,l,r,mid;
  while(scanf("%d%d%d",&len,&n,&m)!=EOF)
  {
    stone[0]=0;
    stone[n+1]=len;
    for(i=1;i<=n;i++)
      scanf("%d",&stone[i]);
    sort(stone+1,stone+n+1);
    l=0;r=len;
    while(l<=r)
    {
       mid=(l+r)/2;
       if(ok(mid)) r=mid-1;
       else l=mid+1;
    } 
    printf("%d\n",l); 
   }
   return 0;
}