poj 2456 Aggressive cows

原题：
Aggressive cows
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 17845 Accepted: 8504
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.
Source

USACO 2005 February Gold

中文：
有一排牛舍，现在让你安排m只牛，使得这m只牛每两只之间的相互距离中最小值最大。

//#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<limits.h>
using namespace std;
int n,m;
int a[100001];
bool solve(int x)//m个
{
    int cnt=1;
    int pre=a[1],i=2;
    while(i<=n)
    {
        if(a[i]-pre>=x)
        {
            pre=a[i];
            cnt++;
        }
        i++;
        if(cnt==m)
            return true;
    }
    return false;
}
int main()
{
    ios::sync_with_stdio(false);
    while(cin>>n>>m)
    {
        int R=-1,L=INT_MAX;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
            R=max(a[i],R);
            L=min(a[i],L);
        }
        sort(a+1,a+1+n);
        int mid,ans=-1;
        while(R-L>1)
        {
            mid=(L+R)/2;
            if(solve(mid))
                L=mid;
            else
                R=mid;
        }
        cout<<L<<endl;
    }
    return 0;
}

解答：
裸的二分

二分枚举牛之间的最小距离，然后判断是否能摆成即可。