River Hopscotch

Every year thecows hold an event featuring a peculiar version of hopscotch that involves carefullyjumping from  rock to rock in a river.The excitement takes place on a long, straight river with a rock at the startand 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 integraldistance 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 atthe ending rock, jumping only from rock to rock. Of course, less agile cowsnever make it to the final rock, ending up instead in the river.

Farmer John isproud of his cows and watches this event each year. But as time goes by, hetires of watching the timid cows of the other farmers limp across the short distancesbetween rocks placed too closely together. He plans to remove several rocks inorder to increase the shortest distance a cow will have to jump to reach theend. He knows he cannot remove the starting and ending rocks, but he calculatesthat he has enough resources to remove up to M rocks (0≤ M ≤ N).

FJ wants to knowexactly how much he can increase the shortest distance *before* hestarts removing the rocks. Help Farmer John determine the greatest possibleshortest 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 howfar some rock is away from the starting rock. No two rocks share the sameposition.

Output

Line 1: A single integer that is the maximum of theshortest 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 jumpof 2 from 0 (the start) to 2. After removing the rocks at 2 and 14, theshortest required jump is a jump of 4 (from 17 to 21 or from 21 to 25).

题意：在N+2个数中删除M个数，使之间的最小间隔最小

好吧，说二分，想了很久，就是用最小间隔与最大间隔去中点，然后一个个去除石头，当两块石头间的距离小于mid时就将这两块石头间的石头去掉，直到两块石头间的距离大于等于M,否则最小距离就不是mid，一直取二分

#include<bits/stdc++.h>
using namespace std;

int a[50010];
int L,N,M;

int bsearch(int low,int high)
{
	while(low <= high){
		int mid = (low+high)/2;		//最小移动距离为mid 
		int stone = 0;
		int dis = 0;
		
		for(int i = 1; i <= N+1; i++){
			dis += a[i]-a[i-1];
			if (dis <= mid)		//距离和小于mid时说明这些石头可以移除掉，否则mid不是最小距离 
				stone++;
			else
				dis = 0;
		}
		if (stone <= M)
			low = mid+1;
		else
			high = mid-1; 
	}
	
	return low;
}


int main()
{
	while(~scanf("%d%d%d",&L,&N,&M)){
		int low = 0x3f3f3f3f;
		int high = L;
		a[0] = 0;
		a[N+1] = L;
		
		for(int i = 1; i <= N; i++)
			cin >> a[i];
		sort(a,a+N+2);
		for(int i = 1; i <= N+1; i++)
			low = min(low,a[i]-a[i-1]);
			
		int ans = bsearch(low,high);
		cout << ans << endl;
	}
	return 0;
}