poj 2456 Aggressive cows （最小值最大化二分问题）

最新推荐文章于 2024-07-28 10:31:05 发布

键盘里的青春

最新推荐文章于 2024-07-28 10:31:05 发布

阅读量2.8k

点赞数 1

分类专栏：二分 ACM

本文链接：https://blog.csdn.net/qq_34374664/article/details/53366987

版权

ACM 同时被 2 个专栏收录

506 篇文章 33 订阅

订阅专栏

二分

24 篇文章 0 订阅

订阅专栏

博客介绍了如何解决POJ 2456问题，即安排牛到编号隔间中，使任意两头牛的间隔差值最大。通过排序隔间并使用二分查找来确定最小值的最大化，以确保所有牛都能被容纳并找到最大间隔。

摘要由CSDN通过智能技术生成

Aggressive cows

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 11952		Accepted: 5842

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

Sample Output

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.

题意要表达的是：把C头牛放到N个带有编号的隔间里，使得任意两头牛所在的隔间编号的最小差值最大。例如样例排完序后变成1 2 4 8 9，那么1位置放一头牛，4位置放一头牛，它们的差值为3；最后一头牛放在8或9位置都可以，和4位置的差值分别为4、5，和1位置的差值分别为7和8，不比3小，所以最大的最小值为3。

分析：这是一个最小值最大化的问题。先对隔间编号从小到大排序，则最大距离不会超过两端的两头牛之间的差值，最小值为0。所以我们可以通过二分枚举最小值来求。假设当前的最小值为x，如果判断出最小差值为x时可以放下C头牛，就先让x变大再判断；如果放不下，说明当前的x太大了，就先让x变小然后再进行判断。直到求出一个最大的x就是最终的答案。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int INF = 1e9 + 5;
const int maxn = 1e5 + 5;
int n, k, x[maxn];
int check(int d)   //这里一开始可能想不出来。。
{
    int last = 0;
    for(int i = 1; i < k; i++)  //这里写的很秒
    {
        int cur = last + 1;   //用两个变量“比”着判断。。再次知道用变量移动的妙处（上次潘学长写的优先队列那题也是）
        while(cur < n && x[cur] - x[last] < d)
            cur++;
        if(cur == n) return 0;
        last = cur;
    }
    return 1;
}
int main()
{
    while(~scanf("%d%d", &n, &k))
    {
        for(int i = 0; i < n; i++)
            scanf("%d", &x[i]);
        sort(x, x+n);
        int l = 0, r = INF;
        while(r - l > 1)
        {
            int mid = (l + r) / 2;
            if(check(mid)) l = mid;
            else r = mid;
        }
        printf("%d\n", l);
    }
    return 0;
}