poj 2456 Aggressive cows (二分+贪心) (最大化最小值)

@(K ACMer) by 题解工厂

---

题意:

给n个数,让你选择其中m个数,让相邻数的最小值最大.(即最大化最小值问题).

---

分析:

典型的贪心 + 二分组合.注意这个组合的出现,对于不容易直接得出结果的问题,二分的查找结果,贪心得验证结果是标配!

---

Code:

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int M = int(1e5) + 9;
int p[M], n, m;

bool C(int x) {
    int ret = 0;
    for (int i = 0; i < n;) {
        int j;
        for (j = i + 1; j < n; j++) {
            if (p[j] - p[i] >= x) {
                ret++;
                break;
            }
        }
        i = j;
    }
    return ret >= m - 1;
}

void solve(void) {
    int l = 0, r = p[n - 1] - p[0];
    while (r - l > 1) {
        int mid = (l + r) / 2;
        if (C(mid)) l = mid;
        else r = mid - 1;
    }
    printf("%d\n", C(r) ? r : l);
}

int main(void)
{
    while (~scanf("%d%d", &n, &m)) {
        for (int i = 0; i < n; i++) {
            scanf("%d", &p[i]);
        }
        sort(p, p + n);
        solve();
    }
    return 0;
}