超级会员免费看
农夫John面临将C头牛分配到N个位置的畜栏中，以最大化它们之间的最小距离的问题。通过排序畜栏位置并使用二分查找策略，可以找到最大的最小距离。样例输入和输出展示了算法的应用。
题目
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 distan
订阅专栏 解锁全文
扫一扫
740
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
