题目:
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
* Lines 2..N+1: Line i+1 contains an integer stall location, xi
Output
Sample Input
5 3 1 2 8 4 9
Sample Output
3
Hint
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.
分析:
经典的二分问题;
代码:
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
const int maxn=100002;
const int inf=0x7fffffff;
int x[maxn];
int n,c;
bool ok(int m)
{
int last=0;
for(int i=1;i<c;i++)
{
int cur=last+1;
while(cur<n&&x[cur]-x[last]<m)
cur++;
if(cur==n)
return 0;
last =cur;
}
return true;
}
int main()
{
cin>>n>>c;
for(int i=0;i<n;i++)
scanf("%d",&x[i]);
sort(x,x+n);
int l=0,r=inf;
for(int i=0;i<100;i++)
{
int m=(l+r)/2;
if(ok(m))
l=m;
else r=m;
}
cout<<l<<endl;
return 0;
}