The Frog's Games 4004 (二分)***
来源:互联网 发布:家装设计图软件 编辑:程序博客网 时间:2024/05/12 04:49
The Frog's Games
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 4781 Accepted Submission(s): 2315
Problem 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).
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.
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 2225 3 311 218
Sample Output
411#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;#define INF 0x3f3f3fint ll,n,m;int a[510000];int main(){int i,ans;while(scanf("%d%d%d",&ll,&n,&m)!=EOF){a[0]=0;a[n+1]=ll;int l=0,r=ll,mid;for(i=1;i<=n;i++)scanf("%d",&a[i]);sort(a,a+n+1);n=n+1;while(l<=r){mid=(l+r)/2;int sum=0,k=1;i=1;while(i<=n){int t=a[i]-a[i-1];if(sum+t>mid){sum=t;k++;i++;if(sum>mid){k=INF;break;}}else{i++;sum+=t;}if(k>m)break;}if(k<=m){r=mid-1;ans=mid;}elsel=mid+1;}printf("%d\n",ans);}return 0;}
0 0
- The Frog's Games 4004 (二分)***
- HDU 4004 THE FROG’S GAMES(二分)
- HDOJ 4004 The Frog's Games 二分
- HDU 4004 The Frog's Games(二分)
- HDU 4004 The Frog's Games(二分)
- hdu 4004 The Frog's Games【二分】
- hdu 4004 The Frog's Games 【二分】
- HDU 4004 The Frog's Games (二分)
- 4004 The Frog's Games --二分+贪心
- HDU 4004 The Frog's Games [二分]
- HDU-4004-The Frog's Games【二分】
- 【HDU 4004 The Frog's Games】+ 二分
- HDUoj 4004 The Frog's Games ( 二分
- HDU:4004 The Frog's Games<二分>
- Hdu 4004 The Frog's Games(二分)
- HDU4004 The Frog's Games(二分)
- The Frog's Games(二分)
- The Frog's Games (二分)
- 回形遍历(螺旋遍历)实现-C语言版
- hdoj 2588 GCD【欧拉函数】
- 服务程序中侦测用户logon和logoff消息
- 八月日记
- hdu1037 Keep on Truckin'
- The Frog's Games 4004 (二分)***
- 多语言化(session)
- java08-24
- 干货分享:如何把APP软文推广做到好
- 从错误中学python(5)——list的sort方法
- android 组件ViewFlipper实例
- Java类笔试知识点收集
- java RTTI笔记整理
- 利用qq设置个性化的域名邮箱