BNUOJ 8108

原创 2016年08月29日 15:39:39

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;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

API8108A 10秒语音电路 超简单

  • 2009年09月04日 10:45
  • 90KB
  • 下载

API8108A语音芯片

  • 2013年06月19日 10:31
  • 284KB
  • 下载

贪心(bnuoj49103+二分+贪心)

贪心   小明喜欢养小鸡,小鸡喜欢吃小米。小明很贪心,希望养s只不同种类的小鸡,小鸡也很贪心,每天除了吃固定的ai粒小米外,还想多吃bi*s粒小米。 小明每天有M(0(0种。问小明最多可以养多少只小鸡...

建伍对讲机TK-8108

  • 2014年07月05日 22:20
  • 3.06MB
  • 下载

NI PXI-8108 User Manual and Specifications

  • 2013年12月22日 18:06
  • 2.75MB
  • 下载

BNUOJ-4057-魔方系列——最小装箱

魔方系列——最小装箱 Time Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class n...

KENWOOD TK8108维修手册

  • 2015年03月04日 09:41
  • 4.12MB
  • 下载

bnuoj52303 Floyd-Warshall(2016四川省赛)(生成树+倍增+SPFA)

题目链接:Floyd-Warshall题意:给你n个点,m条双向边,再给你q个询问,每个询问输入x,y,叫你求x到y的最短距离。数据范围:1≤n≤105,0...

8108 计算机信息管理实验一

  • 2008年11月23日 22:51
  • 1.76MB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:BNUOJ 8108
举报原因:
原因补充:

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