（POJ3258）River Hopscotch <二分法>

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 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 M 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: L, N, 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

题意：
一条长为l（1~1,000,000,000）的河中，有n(1~50,000)块可垫脚的石头（不包括起始点和终点的），给出它们与起始点的距离rock[i]，现在要你移除其中的m块，使得具有最小间距的相邻两块石头之间的距离最大。

连接：http://www.cnblogs.com/kedebug/archive/2013/04/20/3032710.html
分析：

1. 和 POJ 3273 一样的技巧，都是要 求“上（下）界的最小（大）值”问题，以后遇到类似的可以用二分的思路往上面靠;

2. 假设要输出的最终结果为 mid，则根据 mid 的值来确定最少需要去掉多少垫脚石。不断通过二分搜索来锁定最终的值;

3. 解题的时候要注意边界问题，相同符合条件的要尽量往最小（大）上面靠，就如同求：有序递增数组中 x 值的最小（大）下标一样;

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

const int maxn = 50010;
int d[maxn];
int n,m,L;

int binarysearch(int low,int high)
{
    int mid;
    while(low <= high)
    {
        mid = (low + high) / 2;
        int cnt = 0;
        int s = 0, e = 1;
        while(e < n)
        {
            if(d[e] - d[s] >= mid)
            {
                s = e;
                e++;
            }
            else
            {
                e++;
                cnt++;
            }
        }
        if(cnt > m)
            high = mid - 1;
        else low = mid + 1;
    }
    return high;
}

int main()
{
    while(scanf("%d%d%d",&L,&n,&m)!=EOF)
    {
        int cur = 0,x;
        for(int i=1;i<=n;i++)
            scanf("%d",&d[i]);
        d[0] = 0; d[n+1] = L;
        n += 2;
        sort(d,d+n);
        int mind = L;
        for(int i=1;i<n;i++)
        {
            mind = min(mind,d[i]-d[i-1]);
        }
        printf("%d\n",binarysearch(mind,L));
    }
    return 0;
}