River Hopscotch(二分)

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 5473		Accepted: 2379

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 Mrocks (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 ofM 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

输入L,N,M;L表示终点离起点的距离，从起点到终点有N块石头（不包含起点和终点），要求移除M块石头后，使得那时的最短距离尽可能的大，并输出这个距离；
类似于poj3273；

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

 const int N = ;
 int l,n,m;
 int rock[N+];
 int low,high,mid;

 bool judge(int mid)
 {
     int sum = ;
     int group = ;
     for(int i = ; i <= n+; i++)
     {
         if(sum + (rock[i]-rock[i-]) <= mid)
         {
             sum += rock[i]-rock[i-];
             group++;
         }
         else
         {
             sum = ;
         }
     }
     if(group > m)
         return false;
     return true;
 }

 int main()
 {
     scanf("%d %d %d",&l,&n,&m);
     rock[] = ;
     rock[n+] = l;
     low = l;
     high = l;
     for(int i = ; i <= n+; i++)
     {
         if(i <= n)
             scanf("%d",&rock[i]);
         if(low > rock[i]-rock[i-])
             low = rock[i]-rock[i-];
     }
     sort(rock,rock+(n+));

     while(low <= high)
     {
         mid = (low+high)/;
         if(!judge(mid))
             high = mid-;
         else low = mid+;
     }
     printf("%d\n",low);
     return ;
 }