链接：https://ac.nowcoder.com/acm/contest/22353/C
来源：牛客网
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?

输入描述:

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

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

输出描述:

* Line 1: One integer: the largest minimum distance
示例1

输入

复制 5 3 1 2 8 4 9 
5 3
1
2
8
4
9

输出

复制 3 
3
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
const int N=100001;
int a[N];
int n,c;
int mins(int l,int r){
    int mid=(l+r)/2;
    int cnts=1;
    int ai;
    while(l<=r){
        ai=a[1];
        cnts=1;
        mid=(l+r)/2;
        for(int i=2;i<=n;i++){
            if((a[i]-ai)>=mid){
            cnts++;
            ai=a[i];
            }
        }
        if(cnts>=c) {l=mid+1;} //cout<<"l"<<l<<" ";}
        else {r=mid-1;}//cout<<"r"<<r<<" ";}
    }
    return l-1;
}
int main()
{
    scanf("%d%d",&n,&c);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    int x=mins(1,a[n]);
    if(x)
    cout<<x<<endl;
    return 0;
}
AK了，还是尽量多注意注意二分吧