程序设计与算法二郭炜二分算法007Aggressive cows及其解题思路

题目

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.

解题思路

牛棚分布在0~10亿的一条直线上，先将输入的牛棚位置从大到小排序。使用二分算法，左端点为最小的牛棚位置，右端点为最大的牛棚位置，每次取牛棚之间的距离为左端点和右端点的中间点，即左端点加右端点除二。若在这个间距之下，每头牛都分配到牛棚，就将左端点取为中间点加一。若不是每头牛都分配到牛棚，则将右端点取为中间点减一。直到左端点大于右端点为止。

代码实现

# include <iostream>
# include <algorithm>

using namespace std;

int main()
{
	int sta,cow,cnt,lastmid;
	long long int left = 0, right = 0, mid = 0;

	cin >> sta >> cow;
	long long int pos[sta+1];
	for(int i = 0; i < sta; i++) cin >> pos[i];
	sort(pos, pos + sta); // 将牛棚位置排序
	left = pos[0]; 
	right = pos[sta - 1];
	
	while(left <= right){
		mid = (left + right)/2;
		cnt = cow - 1; 
		for(int i = 0, j = 1;i + j < sta; j++){ // 在某一间隔下是否每头牛都能分配到牛棚
			if(pos[i] + mid <= pos[i + j]){
				cnt--;
				if(!cnt) break;
				i = i + j;
				j = 0;
			}	
		}
		if(!cnt) {
			left = mid + 1;
			lastmid = mid; // 记录分配成功的间隔
		}
		else right = mid - 1;	
	}
	if(cnt) mid = lastmid; // 若最后一次分配失败，就将上一次分配成功的间隔输出
	cout << mid;
	
	return 0;
}