E - Aggressive 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?
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 minimum distance of 3.
Huge input data,scanf is recommended.
较为简单的二分问题
AC代码:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<string>
#include<algorithm>
#include<map>
#include<sstream>
#include<set>
#define debug(x) cout << "[" << #x <<": " << (x) <<"]"<< endl
#define CLE(a,b) memset(a,b,sizeof(a))
#define MEC(a,b) memcpy(a,b,sizeof(a))
#define ll long long
#define inff 0x7fffffff
const int inf = 1e9 + 5;
ll book[100005];
int c, n;
int judge(int d)
{
int cur, lef = 0;
for (int i = 1;i < c;i++)
{
cur = lef + 1;
while (cur < n && book[cur] - book[lef] < d)
{
cur++;
}
if (cur == n)
return 0;
lef = cur;
}
return 1;
}
using namespace std;
int main()
{
cin >> n >> c;
for (int i = 0;i < n;i++)
{
cin >> book[i];
}
sort(book, book + n);
int l = 0, r = inf;
int ans = 0;
while (r >= l)
{
int mid = (l + r) >> 1;
if (judge(mid))
{
ans = mid;
l = mid + 1;
}
else r = mid - 1;
}
cout << ans << endl;
return 0;
}