题目链接
题意
有N (2 <= N <= 100,000)个牛棚分布在一条直线上,坐标为 x1,…,xN (0 <= xi <= 1,000,000,000),现在有C(2 <= C <= N)头牛要分置在这些牛棚里,但这些牛喜欢互相图图,距离近了就难逃一鲨,所以要让这些牛的距离尽可能大,求分置所有牛后两两间最小距离的最大值。
思路
卡了上午两个半小时,想过二分却无从敲码,最后黑屁个dp,果不其然超时了,,,
正解:二分查找
先对输入的牛棚坐标排序,则一定有两头牛被放在两端,C头牛将线段分为C- 1段,则解的最大可能值为
max = 两端牛棚距离 / (C - 1),最小可能值为min = 1。
再进行二分查找,判断最小距离为mid = (min + max) / 2时是否可以放下C头牛,然后缩小范围。
注意最后一个符合要求的mid即为解,此后左边界只进行一次min_dist = mid + 1,输出答案时应为min_dist - 1。
代码
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int stall[100005];
bool judge(int mid, int n, int c){
int cow = 1, prepos = 0;
for (int i = 1; i < n && cow < c; i++)
{
if (stall[i] - stall[prepos] >= mid)
{
prepos = i;
cow++;
}
}
return cow == c;
}
int main()
{
int n, c, i, min_dist, max_dist, mid;
scanf("%d%d", &n, &c);
for (i = 0; i < n; i++)
scanf("%d", &stall[i]);
sort(stall, stall + n);
min_dist = 1, max_dist = (stall[n - 1] - stall[0]) / (c - 1);
while (min_dist <= max_dist)
{
mid = (min_dist + max_dist) / 2;
if (judge(mid, n, c))
min_dist = mid + 1;
else
max_dist = mid - 1;
}
cout << min_dist - 1;
return 0;
}