描述
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.
//对二分法不是很熟
// 从1开始到整个区间的长度二分了
#include<bits/stdc++.h>
using namespace std;
int n,c;
int a[100005];
int check(int t)//检查二分点,是什么情况
{
int cnt=1;//计数
int tmp=a[0];//初值
for(int i=0;i<n;i++)
{
if(a[i]-tmp>t)//如果在范围内
{
cnt++;
tmp=a[i];//换值
}
}
if(cnt>=c)//在区间内,l加1,看是否再合适,找到最大的最小值
return 1;
else
return -1;
}
int main()
{
scanf("%d%d",&n,&c);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+n-1);
int l=1,r=a[n-1]-a[0],mid;
while(l<r)//二分法,不用解释了吧
{
mid=l+(r-l)/2;
if(check(mid)>0)
l=mid+1;
else
r=mid;
}
cout<<l;
}