MR CODER

111

BNUOJ 8108

The Frog's Games

1000ms
65768KB
This problem will be judged on HDU. Original ID: 4004
64-bit integer IO format: %I64d      Java class name: Main
Font Size:  
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

Source

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


#include <iostream>
#include <climits>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N= 500011;
int a[N];
int judge(int k);
int l, n, m;


int main()
{
    while(scanf("%d%d%d",&l,&n, &m)!=EOF)
    {
        a[0]=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        sort(a+1,a+n+1);
        int Max=-1;
        for(int i=1;i<=n;i++)
        {
            Max=max(Max,a[i]-a[i-1]);
        }
        a[n+1]=l;
        a[n+2]=INT_MAX;
        Max=max(Max,a[n+1]-a[n]);
        int li=Max-1,ri=l,mid;
        while(mid=(li+ri)/2,li<ri)
        {
            if(judge(mid))
            {
                ri=mid;
            }
            else
            {
                li=mid+1;
            }
        }
        printf("%d\n",ri);
    }
    return 0;
}


int judge(int k)
{
    int now=0;
    for(int i=1;i<=m;i++)
    {
        int j;
        for(j=now;a[j+1]-a[now]<=k;j++);
        now=j;
        if(now==n+1)
        {
            return 1;
        }
    }
    return 0;
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/yjf3151731373/article/details/51559715
个人分类: 二分搜索
想对作者说点什么? 我来说一句

KENWOOD TK8108维修手册

2015年03月04日 4.12MB 下载

建伍对讲机TK-8108

2014年07月05日 3.06MB 下载

没有更多推荐了,返回首页

不良信息举报

BNUOJ 8108

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭