W1——Aggressive cows Problem

问题描述

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

5 3
1
2
8
4
9

Sample Output

3

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.

Code

/*
 * @Description: Aggressive cows
 * @version: 
 * @Author: 
 * @Date: 2021-03-30 22:06:29
 * @LastEditors: Please set LastEditors
 * @LastEditTime: 2021-03-31 15:08:08
 */
// 算法：二分查找，来源于网络
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n, c;
vector<long long> stall;

bool check(int mid)
{
    int ans = 1;
    // 在最小位置放一只
    int temp = stall[0];
    for (int i = 1; i < n; i++)
    {
        if (stall[i] - temp >= mid)
        {
            // 距离大于等于mid则放一只牛
            ans++;
            temp = stall[i];
            if (ans >= c)
                // 如果能放下c只牛则返回true，在右半部分继续查找
                return true;
        }
    }
    // 否则在左边查找
    return false;
}
int main()
{
    scanf("%d %d", &n, &c);
    for (int i = 0; i < n; i++)
    {
        long long num;
        scanf("%lld", &num);
        stall.push_back(num);
    }
    sort(stall.begin(), stall.end());
    int l = 0, r = stall[n - 1] - stall[0], mid;
    while (r >= l)
    {
        mid = (l + r) / 2;
        if (check(mid))
            l = mid + 1;
        else
            r = mid - 1;
    }
    cout << l - 1 << endl;
    system("pause");
    return 0;
}