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

Source

由于可能拿光石头所以要检验mid=L的情况

用两个下标表示两块石头之间的距离，满足长度则更新前坐标，不满足则计数加一，在最后一块石头仍不满足计数也加一，相当于拿走前坐标的石头

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;

int main()
{
    int l,n,m,i,s,t,p,low,high,mid;
    int a[50005];
    while(cin>>l>>n>>m){
        for(i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        sort(a+1,a+n+1);
        a[0]=0;
        a[n+1]=l;
        low=1;high=2*l;
        while(low<high-1){
            mid=(low+high)/2;
            s=0;p=0;
            for(i=1;i<=n+1;i++){
                t=a[i]-a[p];
                if(t<mid){
                    s++;
                }else{
                    p=i;
                }
            }
            if(s>m){
                high=mid;
            }else{
                low=mid;
            }
        }
        cout<<low<<endl;
    }
    return 0;
}

。