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.

数轴上有n个石子，第i个石头的坐标为Di，现在要从0跳到L，每次条都从一个石子跳到相邻的下一个石子。现在FJ允许你移走M个石子，问移走这M个石子后，相邻两个石子距离的最小值的最大值是多少。

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

* Line 1: A single integer that is the maximum of the shortest distance a cow has to jump after removing M rocks

#include<cstdio>
#include<algorithm>
using namespace std;
int n,m,ll,d[50010],l=1,r;
bool f(int a)
{
    int k=0,ji=0;
    for(int i=0;i<=n;i++) d[i]-ji<a?k++:ji=d[i];
    return k<=m?1:0;
}
int main()
{
    scanf("%d%d%d",&ll,&n,&m);
    for(int i=0;i<n;i++) scanf("%d",&d[i]);
    sort(d,d+n);
    d[n]=r=ll;
    while(l<r)
    {
        int mid=(l+r+1)>>1;
        f(mid)?l=mid:r=mid-1;
    }
    printf("%d\n",l);
}

   移除之前，最短距离在位置2的石头和起点之间；移除位置2和位置14两个石头后，最短距离变成17和21或21和25之间的4．