ACM刷题之POJ————River Hopscotch

2人阅读 评论(0) 收藏 举报
分类:
River Hopscotch
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 17988 Accepted: 7516

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 rocks (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 of M 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).


一道二分的题目

一般题目让你求什么,就二分什么,这里求距离,就二分距离。

这里的输入数据是无序的,记得排序。

统计节点的距离小于二分值的个数,然后比较就好了。

注意一点,删除后,那个节点前后距离都会改变,不能单单计算前面减后面的距离来计数。


这里给两个样例:

10 0 0 

0


10 1 1

6

10


下面是ac代码

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<iostream>
using namespace std;
#define MID(x,y) ((x+y)>>1)
#define CLR(arr,val) memset(arr,val,sizeof(arr))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int N=2e5+7;

int i, j, le, n , m; 
int a[N];

bool check(int mi) {
	int cnt = 0, before = 0;
	for (i = 1 ; i <= n; i ++) {
		if (a[i] - a[before] <= mi) {
			++cnt;
		} else {
			before = i;
		}
	}
	if (cnt > m) {
		return true;
	} else return false;
}

int main()
{
	//freopen("f:/input.txt", "r", stdin);
	while(cin>>le>>n>>m) {
		int maxn = -INF;
		a[0] = 0;
		for (i = 1; i <= n; i ++) {
			cin>>a[i];
			if (a[i] > maxn) maxn = a[i];
		}
		a[++n] = le; 
		sort(a, a + n);
		int l = 0, r = le * 2, mid;
		while (l < r) {
			mid = MID(l, r);
			if (check(mid)) {
				r = mid;
			} else {
				l = mid + 1;
			}
		}
//		if (l == le) --l;
		cout<<l<<endl;
	}
}

查看评论

【二分法】POJ3258-River Hopscotch

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

POJ 3258 River Hopscotch (二分经典)

River Hopscotch Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 10591   Accepted:...
  • yao1373446012
  • yao1373446012
  • 2016-06-03 07:33:20
  • 448

POJ3258:River Hopscotch(二分)

Description Every year the cows hold an event featuring a peculiar version of hopscotch that invo...
  • libin56842
  • libin56842
  • 2014-08-18 14:45:42
  • 2539

POJ - 3258 River Hopscotch 二分

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

POJ3258-- River Hopscotch

题目大意:Farmer John来观看一群牛在河里玩跳格子游戏,他想增加观赏性,所以,准备给这个游戏增加难度,河里原先有N个石头作为落脚点,现在,他要拿走M个石头,来增加这些牛每次跳的最短距离。从河岸...
  • hhhhhhj123
  • hhhhhhj123
  • 2015-08-22 20:04:16
  • 227

POJ3528:River Hopscotch(二分)

River Hopscotch Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 12487   Accepted:...
  • junior19
  • junior19
  • 2017-02-06 00:26:16
  • 99

acm新手刷题攻略之poj

  • 2010年11月02日 18:09
  • 6KB
  • 下载

POJ刷题顺序

POJ从简到难(按照AC数目排序)的列表如下,作为小弱的刷题顺序。大牛们可以看后面倒排的hard表,还有四道题没人拿到first blood. 表格属性依次为:ID,Title, Ratio, AC...
  • zc1994113
  • zc1994113
  • 2015-12-23 22:36:21
  • 7791

[ACM] poj 1700 Crossing River (经典过河问题)

Crossing River Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 10212  ...
  • sr19930829
  • sr19930829
  • 2014-04-29 16:11:03
  • 2272

POJ 3258 River Hopscotch (二分法)

传送门:http://poj.org/problem?id=3258 River Hopscotch Time Limit: 2000MS   Memory Limit: 65...
  • wchhlbt
  • wchhlbt
  • 2016-05-30 20:07:35
  • 315
    个人资料
    持之以恒
    等级:
    访问量: 4万+
    积分: 1439
    排名: 3万+
    最新评论