G - River Hopscotch(二分)

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, Lunits 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 D_i from the start (0 < D_i < 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).

 

题意：小牛过河，可以移除M块石头，寻找所跳最小距离的最大值

题解：1 —— L之间进行二分查找，如果存在当前位置last+mid > a[i] 说明此种方案存在更小的距离，要想保证此时的mid为最小距离就要将当前的石块去除，用cnt记录已经去除石块的个数，如果cnt > M(所给的能够去除石块的个数），则更新 right = mid - 1，否则 left = mid + 1;

AC代码

#include<stdio.h>
#include<algorithm>

using namespace std;


int l, n, m;
int a[50005];
int solve(int x)
{
    int cnt = 0;
    int last = 0;
    for(int i = 1; i <= n+1; i++)
    {
        if(a[i] < last + x)     //当前的位置加上跳的距离能够到达下一个石头
            cnt++;      //存在更小的跳跃距离
        else
            last = a[i];       //更新当前位置
    }
    return cnt;
}

int main()
{
    int right, mid, left;
    while(~scanf("%d%d%d", &l, &n, &m))
    {
        for(int i = 1; i <= n; i++)
            scanf("%d", &a[i]);
        sort(a+1, a+n+1);
        a[n+1] = l;
        int ans = 0;
        right = l;
        left = 1;
        while(left <= right)
        {
            mid = (left + right) / 2;
            if(solve(mid) > m)
                right = mid - 1;
            else
                left = mid + 1;
        }
        printf("%d\n", left - 1);
    }
    return 0;
}