本道题目是来自北大百练上的一道题目
链接地址: http://bailian.openjudge.cn/practice/2456
总时间限制: 1000ms 内存限制: 65536kB
描述
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
提示
OUTPUT DETAILS:
FJ can put his 3 cows in the stalls at positions 1, 4 and 8, resulting in a minimum distance of 3.
Huge input data,scanf is recommended.
思路
主要是利用二分法查找
代码如下:
n, c = map(int, input().split())
a = []
for i in range(n):
a.append(int(input()))
a.sort()
# 最小的间距
min_length = a[1] - a[0]
# 最大的间距一定是第一位和最后一位
max_length = a[len(a)-1] - a[0]
while min_length <= max_length:
mid = min_length + (max_length - min_length)//2
last = a[0]
count = 1
# 判断此间距下,能否放下C头牛
for i in range(n):
if a[i] - last >= mid:
count += 1
last = a[i]
if count >= c:
min_length = mid+1
else:
max_length = mid-1
print(min_length-1)