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

题意：农夫john建立了许多隔间，并且知道各自的距离，同时，他还养了许多喜欢打架的牛，这些牛不能紧挨着，我们得把他们放到不同的隔间里，问牛牛们隔的最远的距离是多少。

思路：我们需要一个数，也就是牛牛们相隔的距离，并且这个数必须满足有隔间能放牛，我们可以从最小的隔间坐标到最大的隔间坐标形成的区间内去枚举试探，但是吧，数据量大的很，显然直接就超时，我们可以考虑用二分查找的方法去找这个最大的数，检测的时候我们可以看所有的隔间能不能放得下所有得牛。

代码：

#include<iostrea