POJ-2456 Aggressive cows

原题链接：

https://vjudge.net/problem/POJ-2456

AC代码：

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
const int INF = 0x3fffffff;
typedef long long ll;
typedef unsigned long long ull;

void __init__()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
} //head
const int maxn = 100005;
int x[maxn];
int n, c;
int check(int a)
{
    int temp = x[0];
    int cnt = 1;
    for (int i = 1; i < n; i++)
    {
        if (x[i] - temp >= a)
        {
            cnt++;
            temp = x[i];
        }
    }
    if (cnt >= c)
    {
        return 1;
    }
    else
        return 0;
}
int main()
{
    // __init__();

    scanf("%d%d", &n, &c);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &x[i]);
    }
    sort(x, x + n);
    int ans = 0;
    int l = x[0], r = x[n - 1];
    while (l <= r)
    {
        int mid = l + (r - l) / 2;
        if (check(mid))
        {
            ans = mid;
            l = mid + 1;
        }
        else
            r = mid - 1;
    }
    cout << ans << endl;

    return 0;
}

二分遍历可能的间距，check判断以此为间距是否满足条件，若满足则扩大间距继续判断，若不满足，则说明间距太大了，牛放不开，因此缩小间距。