POJ2456-Aggressive cows

 

题目链接：点击打开链接

Description

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.

 

 

 

题意：就是从0 - 1000000000长度中，找一个最大的能满足把所有奶牛，放入给定的房间里的那个长度；

 

 

 

思路：二分。从整体长度二分。每确定一个mid就去给定区间里 看满足不满足 能把所有奶牛放进去。 满足的话，记录下来，最后输出最大的那个。

AC代码：

#include
#include
#include
#include
#include
#include