Aggressive cows

二分搜索： 

Description

Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1,...,xN (0 <= xi <= 1,000,000,000).

His C (2 <= C <= N) cows don't like this barn layout and become aggressive towards each other once put into a stall. To prevent the cows from hurting each other, FJ want to assign the cows to the stalls, such that the minimum distance between any two of them is as large as possible. What is the largest minimum distance?

Input

* Line 1: Two space-separated integers: N and C

* Lines 2..N+1: Line i+1 contains an integer stall location, xi

Output

* Line 1: One integer: the largest minimum distance

Sample Input

5 3
1
2
8
4
9

Sample Output

3

Hint

OUTPUT DETAILS:

FJ can put his 3 cows in the stalls at positions 1, 4 and 8, resulting in a minimum distance of 3.

Huge input data,scanf is recommended

二分搜索： 

#include<stdio.h>
#include<algorithm>
using namespace std;
int n,m;	
int x[100005];
bool ok(int maxv)
{
	int cur=0;
	for(int i=1;i<m;i++)
	{
		int j;
		for( j=cur;j<n;j++)
		{
			if(x[j]-x[cur]>=maxv)
			{
				cur=j;
				break;
			}	
		}
		if(j==n)//由于此时i<m,即对于该距离找不到足够的棚，说明距离大了；
		{
			return false;
		}
	}
	return true;//前面没有退出说明距离可满足；
}
int main()
{

	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&x[i]);
	}
	sort(x,x+n);
	int d=x[n-1]-x[0];
	int l=0;
	int r=d;
	while(r-l>1)//二分搜索找到要求的距离 
	{
		int mid=(r+l)/2;
		if(ok(mid)){
			l=mid;
		}
		else//如果找不到缩小 
		r=mid; 
	}
	printf("%d",l);
 }