Aggressive cows

总时间限制: 1000ms 内存限制: 65536kB

描述

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

样例输入

5 3
1
2
8
4
9

样例输出

3

提示

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.

来源

USACO 2005 February Gold

题目OJ链接：http://bailian.openjudge.cn/practice/2456/

题目分析：

（参考http://blog.csdn.net/wuxiushu/article/details/49158843）

题意要表达的是：把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<algorithm>
#include<stdio.h>
#include<string.h>
using namespace std;
const int MAX = 100010;
int a[MAX],n,m;

bool C(int d)
{
    int t = a[0],count = 1;
    for(int i = 1;i < n;i ++)
    {
        if(a[i] - t >= d)
        {
            count ++;
            t=a[i];
            if(count >= m)
                return true;
        }
    }
    return false;
}


int solve()
{
    int x = 0,y = a[n-1] - a[0];
    while(x <= y)
    {
        int mid=(x+y)/2;
        if(C(mid))
            x=mid + 1;
        else
            y=mid - 1;
    }
    return x - 1;
}


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

 

代码二：（一点点小的改动，更好理解）

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
using namespace std;
const int MAX = 100010;
int a[MAX],n,m;

bool C(int d)
{
    int t = a[0],count = 1;
    for(int i = 1;i < n;i ++)
    {
        if(a[i] - t >= d)
        {
            count ++;
            t=a[i];
            if(count >= m)
                return true;
        }
    }
    return false;
}


int solve()
{
    int x = 0,y = a[n-1] - a[0],ans=0;
    while(x <= y)
    {
        int mid=(x+y)/2;
        if(C(mid))
        {
            ans=mid;x=mid + 1;
        }
        else
            y=mid - 1;
    }
    return ans;
}


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

 

代码三：差不多思路，主要区别在检测函数

#include <iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;

const int N=100000+10;
long long arr[N]={0};
int n,c;

bool check(long long x)
{
    long long temp=arr[0]+x;
    int count=1;//第一个牛棚必选 
    for(int i=1;i<n;i++)
    {
        if(arr[i]>=temp)
        {
            count++;
            temp=arr[i]+x;
            if(count==c) return true;
        }
    }
    return false;
}

int binsearch(long long l,long long r)
{
    long long mid;
    while(l<=r)
    {
        mid=(l+r)/2;
        if(check(mid)) l=mid+1;
        else r=mid-1;
    }
    return l-1;
}
int binsearch2(long long l,long long r)
{
    long long mid;int ans=0;
    while(l<=r)
    {
        mid=(l+r)/2;
        if(check(mid)) 
        {
            ans=mid;l=mid+1;
        }
        else r=mid-1;
    }
    return ans;
}
int main() 
{
    while(~scanf("%d%d",&n,&c))
    {
        for(int i=0;i<n;i++)
            scanf("%lld",&arr[i]);
        sort(arr,arr+n);
        printf("%d\n",binsearch2(0,arr[n-1]-arr[0]));
    }
    return 0;
}

binsearch两个函数都可以用。