BNUOJ 8108

原创 2016年06月01日 22:43:34

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

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

NI PXI-8108 User Manual and Specifications

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

KENWOOD TK8108维修手册

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

HDU 2063 BNUOJ 6207 过山车 (最大流or二分匹配)

满足二分图矛盾的性质,女生编号为1~M,男生则为M+1~M+N,输入时处理,然后直接建边,求出最大匹配数即为答案。#include #include #include #include #in...

API8108A 10秒语音电路 超简单

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

API8108A语音芯片

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

bnuoj 51275(道路修建-并查集按秩合并)

题意:维护一个并查集,但需要询问2个点是在第几次操作后连通的。 直接可持久化并查集应该行, 但更简单的方法是,把并查集按秩合并, 即t时刻,在u,v所处连通块间连一条权值为t的边, 这样每个并...

建伍对讲机TK-8108

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

简单的传球游戏(矩阵快速幂) bnuoj49104

An=(k-1)^(n-1)+An-1构造矩阵进行矩阵快速幂
  • lov_vol
  • lov_vol
  • 2016年05月01日 15:19
  • 187

8108 计算机信息管理实验一

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

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