HDU - 4004 The Frog's Games (二分)去掉m个石头求最小间距

原创 2016年06月01日 14:13:15
HDU - 4004
Time Limit:                                                        1000MS                          Memory Limit: 65768KB   64bit IO Format:                            %I64d & %I64u                       

Status

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).      
               

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
               

Hint

Source

The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest
//题意:
先输入三个数,L,n,m表示一条河的宽度为L,在河的中间有n块石头,最多只能跳m次,问怎样跳使得青蛙的跳的m次中最大的消耗值最小。
//思路:
直接二分,判断两次就行了
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#define N 500010
using namespace std;
int L,n,m;
int a[N];
bool judge(int mid)
{
	int i,j,last=a[0];
	int cnt=0;
	for(i=1;i<=n;i++)
	{
		if(a[i]-a[i-1]>mid)
			return false;
		if(a[i]-last>mid)
		{
			cnt++;
			last=a[i-1];
			if(cnt>=m)
				return false;
		}
	}
	return true;
}
int erfen(int l,int r)
{
	int mid,ans;
	while(l<=r)
	{
		mid=(l+r)>>1;
		if(judge(mid))
		{
			ans=mid;
			r=mid-1;
		}
		else
			l=mid+1;
	}
	return ans;
}
int main()
{
	
	int i,j;
	while(scanf("%d%d%d",&L,&n,&m)!=EOF)
	{
		for(i=1;i<=n;i++)
			scanf("%d",&a[i]);
		a[0]=0;a[++n]=L;
		sort(a,a+n+1);
		printf("%d\n",erfen(0,L));
	}
	return 0;
}

 

HDU 4004(The Frog's Games) 二分查找求答案

题目是青蛙跳石头,给定距离、中间石头及步数,求每步跳的最短距离 L,n都比较大,这里用二分找距离 代码: #include #include #include using namespace s...

hdu4004 The Frog's Games 二分查找+贪心 TWT Tokyo Olympic 1COMBO-2

The Frog's Games Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) ...
  • kyoma
  • kyoma
  • 2016年09月19日 16:06
  • 232

HDU4004The Frog's Games二分!二分!

题目在此 题目大意:一只青蛙被一条宽度为L的河挡住了去路,垂直河岸有一些石头露出水面,这些石头在一条直线上。现在青蛙想要借助这些石头过河,但是最多跳m次,问青蛙最小弹跳多远。 题目分析:要求青蛙的...

HDU:4004 The Frog's Games(二分)

The Frog's Games Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others...
  • zugofn
  • zugofn
  • 2016年04月27日 22:17
  • 220

HDU 4004 The Frog's Games(二分)

Problem Description The annual Games in frogs' kingdom started again. The most famous game is the I...

HDU 4004 The Frog's Games(2011年大连网络赛 D 二分+贪心)

其实这个题呢,大白书上面有经典解法 题意是青蛙要跳过长为L的河,河上有n块石头,青蛙最多只能跳m次且只能跳到石头或者对面。问你青蛙可以跳的最远距离的最小值是多大典型的最大值最小化问题,解法就是贪心二...

The Frog's Games HDU - 4004 (二分)

The annual Games in frogs' kingdom started again. The most famous game is the Ironfrog Triathlon. On...

hdu 4004 The Frog's Games(二分最小化最大值)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4004

HDU 4004 The Frog's Games(青蛙过河,二分)

The Frog's Games Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Othe...

HDU 4004 The Frog's Games(二分)

http://acm.hdu.edu.cn/showproblem.php?pid=4004 The Frog's Games Time Limit: 2000/1000 ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU - 4004 The Frog's Games (二分)去掉m个石头求最小间距
举报原因:
原因补充:

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