poj-3258 River Hopscotch

原创 2012年03月28日 12:58:16

题目链接:http://poj.org/problem?id=3258

River Hopscotch
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 3829   Accepted: 1649

Description

Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a rock at the start and another rock at the end, L units away from the start (1 ≤ L ≤ 1,000,000,000). Along the river between the starting and ending rocks, N (0 ≤ N ≤ 50,000) more rocks appear, each at an integral distance Di from the start (0 < Di < L).

To play the game, each cow in turn starts at the starting rock and tries to reach the finish at the ending rock, jumping only from rock to rock. Of course, less agile cows never make it to the final rock, ending up instead in the river.

Farmer John is proud of his cows and watches this event each year. But as time goes by, he tires of watching the timid cows of the other farmers limp across the short distances between rocks placed too closely together. He plans to remove several rocks in order to increase the shortest distance a cow will have to jump to reach the end. He knows he cannot remove the starting and ending rocks, but he calculates that he has enough resources to remove up to Mrocks (0 ≤ M ≤ N).

FJ wants to know exactly how much he can increase the shortest distance *before* he starts removing the rocks. Help Farmer John determine the greatest possible shortest distance a cow has to jump after removing the optimal set ofM rocks.

Input

Line 1: Three space-separated integers: LN, and M 
Lines 2..N+1: Each line contains a single integer indicating how far some rock is away from the starting rock. No two rocks share the same position.

Output

Line 1: A single integer that is the maximum of the shortest distance a cow has to jump after removing M rocks

Sample Input

25 5 2
2
14
11
21
17

Sample Output

4

Hint

Before removing any rocks, the shortest jump was a jump of 2 from 0 (the start) to 2. After removing the rocks at 2 and 14, the shortest required jump is a jump of 4 (from 17 to 21 or from 21 to 25).
题意:相当于一个数标轴,以0点位起点,输入终点位置L,0-L中的石子块数n,以及要移走的石子块数m;n块石子的坐标会给出;
求(移走m块石子后的每相邻两块石子距离的最大值)的最小值。
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int l,n,m;
	while(cin>>l>>n>>m)
	{
		int i;
		int* rock=new int[n+2];   //动态数组。 n个石子以及起始终点共(n+2)个
		rock[n+1]=l;
		rock[0]=0;
		int min=l,max=l,mid;      //max表示一步的最大距离
		for(i=1;i<=n+1;i++)
		{
			if(i<n+1)
				cin>>rock[i];
			if(rock[i]-rock[i-1]<min)
				min=rock[i]-rock[i-1];     //min:一步的最短距离
		}
		sort(rock,rock+(n+2));   //对石子排序
		while(min<=max)
		{
			mid=(min+max)/2;
			int sum=0;
			int delrock=0;     //清除的石子的数目
			for(i=1;i<=n+1;i++)
			{
				if((sum+=rock[i]-rock[i-1]) <=mid)      //sum来表示一段累计的距离,当sum>mid时,作为一段,sum清零重置
					delrock++;
				else
					sum=0;
			}
			if(delrock<=m)      //清除石子数目不大于m(即使等于m也不一定为最优解),下界需增大;否则上界需减小
				min=mid+1;      //  不是min=mid!
			else
				max=mid-1;
		}
		cout<<min<<endl;
	}
	return 0;
} 



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

POJ 3258 River Hopscotch (二分经典)

River Hopscotch Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 10591   Accepted:...
  • yao1373446012
  • yao1373446012
  • 2016年06月03日 07:33
  • 340

POJ-3258 River Hopscotch

#include #include using namespace std; int L, n, m; const int maxn = 50050; int lx[maxn]; int ma...
  • somniloquy_
  • somniloquy_
  • 2015年07月27日 10:39
  • 226

poj-3258 River Hopscotch

River Hopscotch Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 3659  ...
  • cxb569262726
  • cxb569262726
  • 2012年03月14日 02:23
  • 1871

poj-3258 River Hopscotch (二分)

题意:奶牛过河游戏,河上有N块石头,河的总宽度为L,一位农夫感觉每个石头之间的间距太小了,所以他想通过移除M块石头来使最小的间距最大化。求最大化后的最小距离(姑且是这个题意吧,英语菜) 思路:通过二分...
  • chAngE_AC
  • chAngE_AC
  • 2016年02月18日 15:58
  • 205

POJ-3258 River Hopscotch 解题报告

Description Every year the cows hold an event featuring a peculiar version of hopscotch that invo...
  • angle555945
  • angle555945
  • 2012年03月16日 01:25
  • 655

POJ-3258 River Hopscotch

Poj3258 二分算法
  • Poseidon__ming
  • Poseidon__ming
  • 2016年07月27日 20:44
  • 102

POJ3258-River Hopscotch-二分+贪心【最小值最大化】

给你L,n,m L是一条路总长度 n是路上n个石头 m是要移走m个石头(第一个和最后一个石头不能移走)   设X为剩下的n-m个石头里,石头之间相邻最近的距离 求这个X的最大值 二分X,对于...
  • viphong
  • viphong
  • 2016年02月27日 11:15
  • 197

【二分法】POJ3258-River Hopscotch

【抱大腿】啊啊啊又是一道恶心的题目!!!这道题是出在二分法里面的,因为这跟前面的一道青蛙过河的题特别像但是不一样,按照青蛙过河那个思路来走根本行不通,正好要按照跟那个思路相反的想法来想才行~ ...
  • silent0001
  • silent0001
  • 2016年07月27日 14:53
  • 254

POJ - 3258 River Hopscotch 二分

题目大意:给出河的宽度L和N块石头,现在要求移除M块石头,使得石头间的距离的最小值达到最大(起点和终点都有一块石头,但这两块石头不能移除)解题思路:最小值的最大值,肯定用二分了 如果存在最优的距离,...
  • L123012013048
  • L123012013048
  • 2015年05月11日 18:22
  • 837

POJ 3258 River Hopscotch(二分)

River Hopscotch Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 8975  ...
  • yeguxin
  • yeguxin
  • 2015年07月25日 14:34
  • 584
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj-3258 River Hopscotch
举报原因:
原因补充:

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