CSU-ACM2019寒假训练2-D - Maximize the minimum

最新推荐文章于 2022-01-23 19:08:43 发布

原创

最新推荐文章于 2022-01-23 19:08:43 发布 · 542 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C/C++

农夫约翰需要分配奶牛到畜栏，目标是使最小的奶牛间距离最大化。这是一个最小值最大化问题，可以通过二分搜索结合贪心策略解决。给定畜栏位置和奶牛数量，计算并输出最大的最小距离。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

这个题目就是最小值最大化的问题(也就是说能去的最小值的最大值）~

题目

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 minim