POJ3258 River Hopscotch —— 二分

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

River Hopscotch

Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 15753   Accepted: 6649

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

Source

USACO 2006 December Silver

题解:

写法一:

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 #include <vector>
 7 #include <queue>
 8 #include <stack>
 9 #include <map>
10 #include <string>
11 #include <set>
12 #define ms(a,b) memset((a),(b),sizeof((a)))
13 using namespace std;
14 typedef long long LL;
15 const double EPS = 1e-8;
16 const int INF = 2e9;
17 const LL LNF = 2e18;
18 const int MAXN = 1e5;
19
20 int L, N, M;
21 int a[MAXN];
22
23 bool test(int mid)
24 {
25     int cnt = 0, pre = 1;
26     for(int i = 2; i<=N; i++)
27     {
28         if(a[i]-a[pre]<mid) cnt++;
29         else pre = i;
30     }
31     return cnt<=M;
32 }
33
34 int main()
35 {
36     while(scanf("%d%d%d",&L, &N, &M)!=EOF)
37     {
38         for(int i = 1; i<=N; i++)
39             scanf("%d",&a[i]);
40
41         a[++N] = 0; a[++N] = L;
42         sort(a+1, a+1+N);
43
44         int l = 1, r = L;
45         while(l<=r)
46         {
47             int mid = (l+r)>>1;
48             if(test(mid))
49                 l = mid + 1;
50             else
51                 r = mid - 1;
52             printf("%d %d\n", l, r);
53         }
54         printf("%d\n", r);
55     }
56 }

写法二:

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 #include <vector>
 7 #include <queue>
 8 #include <stack>
 9 #include <map>
10 #include <string>
11 #include <set>
12 #define ms(a,b) memset((a),(b),sizeof((a)))
13 using namespace std;
14 typedef long long LL;
15 const double EPS = 1e-8;
16 const int INF = 2e9;
17 const LL LNF = 2e18;
18 const int MAXN = 1e5;
19
20 int L, N, M;
21 int a[MAXN], tmp[MAXN];
22
23 bool test(int mid)
24 {
25     memcpy(tmp, a, sizeof(tmp));      //!!!!!
26     int cnt = 0;
27     for(int i = 1; i<=N; i++)
28         if(tmp[i]<mid)
29             cnt++, tmp[i+1] += tmp[i];
30     return cnt<=M;
31 }
32
33 int main()
34 {
35     while(scanf("%d%d%d",&L, &N, &M)!=EOF)
36     {
37         for(int i = 1; i<=N; i++)
38             scanf("%d",&a[i]);
39
40         a[++N] = 0; a[++N] = L;
41         sort(a+1, a+1+N);
42         for(int i = 1; i<N; i++)
43             a[i] = a[i+1]-a[i];
44         N--;
45
46         int l = 1, r = L;
47         while(l<=r)
48         {
49             int mid = (l+r)>>1;
50             if(test(mid))
51                 l = mid + 1;
52             else
53                 r = mid - 1;
54         }
55         printf("%d\n", r);
56     }
57 }

时间: 2024-10-25 21:24:01

POJ3258 River Hopscotch —— 二分的相关文章

POJ3258:River Hopscotch(二分)

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 th

POJ 3258 River Hopscotch 二分答案

River Hopscotch Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 6193   Accepted: 2685 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. T

[ACM] POJ 3258 River Hopscotch (二分,最大化最小值)

River Hopscotch Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 6697   Accepted: 2893 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. T

【POJ3258】River Hopscotch 二分答案,贪心check

题意:第一行knm,有n+2个石头在数轴上(k是第n+2个石头离第一个的距离),要删掉m个,使两两间距的最小值最大,并求这个值. 题解:排序一下,然后扫一遍贪心决定删哪些. #include <cstdio> #include <cstring> #include <algorithm> #define N 50500 #define inf 0x3f3f3f3f using namespace std; int dist[N],n,m; int main() { //

POJ 3258 River Hopscotch(二分求最小中的最大)

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 th

POJ - 3258 River Hopscotch 二分

题目大意:给出河的宽度L和N块石头,现在要求移除M块石头,使得石头间的距离的最小值达到最大(起点和终点都有一块石头,但这两块石头不能移除) 解题思路:最小值的最大值,肯定用二分了 如果存在最优的距离,那么移走的石头数量肯定刚好是M块的 枚举的时候判断移除石头的数量,只需要从起点开始枚举,然后计算一下在最小跳跃距离内的石头有几个,有几个就移除几个,最后判断移除了多少个石头 如果移走的数量大于M,就表示所枚举的长度偏大 如果移走的数量小于M,就表示所枚举的长度偏小 有一种比较特殊的情况,就是N =

POJ - 3258 River Hopscotch(二分 最大化最小值)

大致题意: 坐标 从  [0-L], 上有 N 个点 , 现在需要移去 M 个点.求任意两点(包括0,L)点的距离中最小值的最大值 思路:枚举答案,若移去M个点不能达成目标,则使答案变小. while(l <= r){ ll mid = l + (r-l)/2; // 是否可能使得所有石头之间的距离不小于 mid if(check(mid)){ l = mid+1; }else{ r = mid-1; } } printf("%lld\n",l-1); 1 bool check(

POJ3258 River Hopscotch

地址 别人的代码,自己边界总是控制不好,还不知道哪里错了!思维!这种问题代码越简洁反而越不容易错吧.. 1 #include<stdio.h> 2 #include<algorithm> 3 typedef long long ll; 4 using namespace std; 5 ll n,m,L,a[100010]; 6 bool bi(ll x){ 7 ll i,cnt=0,now=0; 8 for(i=1;i<=n;i++){ 9 if(a[i]-a[now]<

bzoj1650 / P2855 [USACO06DEC]河跳房子River Hopscotch / P2678 (noip2015)跳石头

P2855 [USACO06DEC]河跳房子River Hopscotch 二分+贪心 每次二分最小长度,蓝后检查需要去掉的石子数是否超过限制. 1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<algorithm> 5 using namespace std; 6 #define N 50010 7 int n,m,L,a[N]; 8 bool check(int