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?
农夫 John 建造了一座很长的畜栏,它包括N (2 <= N <= 100,000)个隔间,这些小隔间依次编号为x1,…,xN (0 <= xi <= 1,000,000,000). 但是,John的C (2 <= C <= N)头牛们并不喜欢这种布局,而且几头牛放在一个隔间里,他们就要发生争斗。为了不让牛互相伤害。John决定自己给牛分配隔间,使任意两头牛之间的最小距离尽可能的大,那么,这个最大的最小距离是什么呢
Input
Line 1: Two space-separated integers: N and C ;
Lines 2……N+1: Line i+1 contains an integer stall location, xi;
第一行:空格分隔的两个整数N(隔间数)和C(牛数)
第二行—第N+1行:i+1行指出了xi的位置(N个隔间的每个位置)
Output
Line 1: One integer: the largest minimum distance
第一行:一个整数:最大的最小值
Sample Input
5 3
1
2
8
4
9
Sample Output
3
Hint
把牛放在1,4,8这样最小距离是3(相对于放1 4 9,1 4 8中4到8的距离小于4到9的距离,因此是1 4 8)
题目解析:类似的最大化最小值或者最小化的问题,通常用二分搜索法就可以很好的解决
解题思路:(参考白书)
- 先对牛舍的位置进行排序
- 把第一头牛放入x0的牛舍
- 如果第i头牛放入了xj的话,那么第i+1头牛就必须放入xj+d<=xk的最小的xk中。
#include&l