北京大学ACM二分法做牛和栅栏问题

最新推荐文章于 2020-05-18 17:21:35 发布

原创

最新推荐文章于 2020-05-18 17:21:35 发布 · 269 阅读

0 ·

CC 4.0 BY-SA版权

Farmer John面临一个挑战，需要在直线排列的N个马厩中安置C头不喜欢彼此靠近的奶牛。他希望找出最大的最小距离来避免它们之间的冲突。给定每个马厩的位置，问题转化为找到最佳分配方式，使得奶牛间最小距离最大。通过计算，样例输入给出了当N为5，C为3时，最大最小距离为3。

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?
输入
* Line 1: Two space-separated integers: N and C

Lines 2..N+1: Line i+1 contains an integer stall location, xi
输出
Line 1: One integer: the largest minimum distance
样例输入
5 3
1
2
8
4
9
样例输出
3