POJ-2456-Aggressive cows

题目来源：http://poj.org/problem?id=2456
题目内容：Aggressive cows
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 16438 Accepted: 7866
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

题目分析：给定牛舍的个数n以及位置xi，其中有m头牛因为距离太近会打架，为了防止打架事件，我们要尽可能地把每一头牛都放在离其他所有牛尽可能远的位置，问最近两头牛的最远距离是多少。
典型的最大化最小值问题，类似的还有最小化最大值问题，此类问题通常都是用二分搜索来解决的
我们定义一个函数 bool C(d):可以安排能否使得最近两头牛的位置不小于d，如果d偏大，则返回false，否则返回true
那么原问题就等价成了求满足C(d)的最大的d。
事实上，最近两头牛的位置不小于d，也就是说任意两头牛的位置都不小于d，这样实现起来会稍微方便一些，主要代码如下：

bool C(int d){
    int lastPos = 0;//先将第一头牛放到位置pos[0]
    for(int i = 1 ; i < m ; i ++){//m为需要放置的牛的个数，保证数组pos为上升数组的情况下第一头牛放在pos[0]
        int curt = lastPos+1;
        while(curt < n && pos[curt] - pos[lastPos] < d)
            curt ++ ;
        //跳出while循环有两种可能
        //1.curt == n，这说明还没有放置到m头牛，但是位置已经用完了，说明我们预测的d过大，返回false
        //2.pos[curt] - pos[lastPos] >= d,说明在位置curt可以再放置一个奶牛
        if(curt == n) return false;
        else last = curt;
    }
}
void solve(){
    int low = 0,high = INF;
    sort(pos,pos+n);
    while(high - low > 1){
        int mid = (low + high) >> 1;//位运算会比除法运算快得多
        if(C(mid))
            low = mid;//d偏小
        else
            high  = mid;//d偏大
    }
    cout << low << endl;
}