P1824 进击的奶牛（二分）

思路：把检验的函数说一下，就是检测的距离x时，是否存在c个隔断相离大于等于x，如果是则返回1，不是则返回0

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

const int maxn = 1e5 + ;
int a[maxn], n, c, minn=0x3f3f3f3f, ans, mid;

bool check(int x){
    int sum = , base = a[];
    for (int i = ; i <= n; ++i){
        if (a[i] - base >= x){ sum++, base = a[i]; }
        if (sum >= c)return ;
    }
    if (sum +  < c)return ;
    return ;
}

void half(){
    int l = minn, r = a[n] - a[];
    while (l <= r){
        mid = (l + r) >> ;
        if (check(mid)){ l = mid + ; }
        else r = mid - ;
    }
    ans = r;
}

int main(){
    scanf("%d%d", &n, &c);
    for (int i = ; i <= n; ++i)    scanf("%d", &a[i]);
    sort(a + , a + n + );
    for (int i = ; i <= n; ++i) minn = min(minn, a[i] - a[i - ]);
    half();        //二分
    cout << ans << endl;

}