Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 18599 | Accepted: 8841 |
Description
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
#include<stdio.h>
#include<algorithm>
#include<math.h>
using namespace std;
#define INF 999999999
const int MAX_N=100005;
int N,M;
int x[MAX_N];
//判断是否满足条件
bool C(int d)
{
int last=0;
for(int i=1;i<M;i++)
{
int crt=last+1;
while(crt<N&&x[crt]-x[last]<d)
{
crt++;
}
if(crt==N)return false;
last = crt;
}
return true;
}
void solve()
{
sort(x,x+N);
int lb=0,ub=INF;
int mid;
while(ub-lb>1)
{
mid=(lb+ub)/2;
if(C(mid))lb=mid;
else ub=mid;
}
printf("%d
",lb);
}
int main()
{
//freopen("C://Users/Administrator/Desktop/acm.txt","r",stdin);
scanf("%d%d",&N,&M);
for(int i=0;i<N;i++)
{
scanf("%d",&x[i]);
}
solve();
return 0;
}