HDU/HDOJ 4004 2011大连赛区网络赛 D题
来源:互联网 发布:软件推荐 编辑:程序博客网 时间:2024/04/29 21:16
The Frog's Games
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 133 Accepted Submission(s): 70
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
Source
The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest
这个题因为要求最小的最大
很明显应该用二分答案的方法。
关键是判断部分,如果直接暴力判断是二重循环。
这里可以用upper_bound函数把复杂度降下来。
二分+贪心判定
我的代码:
#include<stdio.h>#include<algorithm>using namespace std;int a[500005];int n,m,l;bool judge(int x){int pos=0,cnt=0,id;while(cnt<m){cnt=cnt+1;pos=pos+x;id=upper_bound(a+1,a+1+n,pos)-(a+1);pos=a[id];if(pos==l)return true;}return false;}int main(){int i,left,right,mid,ans;while(scanf("%d%d%d",&l,&n,&m)!=EOF){for(i=1;i<=n;i++)scanf("%d",&a[i]);a[n+1]=l;n=n+1;sort(a+1,a+1+n);left=0,right=l;while(left<=right){mid=(left+right)>>1;if(judge(mid)){right=mid-1;ans=mid;}else{left=mid+1;}}printf("%d\n",ans);}return 0;}
- HDU/HDOJ 4004 2011大连赛区网络赛 D题
- HDU/HDOJ 4002 2011大连赛区网络赛 数论
- 2011大连赛区网络赛 HDOJ
- HDU/HDOJ 4038 2011成都赛区网络赛H题
- 杭电 4004 大连赛区网络赛。
- HDU 4004 - The Frog\'s Games 第36届ACM/ICPC亚洲大连赛区网络赛
- 大连赛区现场赛D题 ZOJ 3542 Hexadecimal View
- 2016acmicpc现场赛大连赛区D题
- HDU 4004 The Frog's Games(2011年大连网络赛 D 二分+贪心)
- HDOJ/HDU 4034 2011成都网络赛D题
- 【icpc网络赛大连赛区】Sparse Graph
- HDU 4002 Find the maximum (欧拉函数-积性函数的性质(2011年大连赛区网络赛第二题)
- 【2016-大连赛区网络赛-I】补图最短路(Sparse Graph,hdu 5876)
- 【2016-大连赛区网络赛-J】线段树,dfs(Weak Pair,hdu 5877)
- 【2016-大连赛区网络赛-F】水题(Football Games,hdu 5873)
- 【2016-大连赛区网络赛-G】(Friends and Enemies,hdu 5874)
- 【2016-大连赛区网络赛-H】优化(Function,hdu 5875)
- hdu 5875 Function 2016ACM/ICPC大连赛区网络赛1008
- 关于代码复杂度的一点想法
- 投资大师罗杰斯给女儿的12 封信
- vb.net数据库异步操作(二)
- Reading Think in Java 【0】
- gcc make file demo
- HDU/HDOJ 4004 2011大连赛区网络赛 D题
- [Cocoa]深入浅出 Cocoa 之 Core Data(2)- 手动编写代码
- SocketAPI,CAsyncSocket,CSocket比较说明及其用法
- AS3中字典Dictionary的使用 .
- 长连接和短连接
- 用java写二叉树的算法
- C#中如何表示文件相对路径
- 单一职责原则
- phpmail使用方法