poj 2456-Aggressive cows （最小值最大化）

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.

题意：在x1-xn上放母牛，使母牛间的距离尽可能大，求使距离最近的两头母牛的距离最大化

思路：贪心+二分

代码：

    

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int a[100005];
int n,c;
int ok(int x)
{
	int cnt=1;//a[0]
	int tmp=a[0];
	for(int i=1;i<n;i++)
	{
		if(a[i]-tmp>=x)
		{
			tmp=a[i];
			cnt++;
			if(cnt>=c)
			   return 1;
		 } 
	}
	return 0;
}
int main()
{
    cin>>n>>c;
	for(int i=0;i<n;i++)
	  scanf("%d",&a[i]);
	sort(a,a+n);
	int l=0,r=a[n-1];
    while(l<=r)
    {
    	int mid=(l+r)/2;
    	if(ok(mid))
    	   l=mid+1;
    	else
    	    r=mid-1;
	}
	cout<<r<<endl;
	return 0;
}