Aggressive cows
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 13542 | Accepted: 6607 |
Description
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?
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
* 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
题意:
n个牛舍, m个牛,怎么放牛才能使得牛与牛之间的最小距离最大?,求最近的两头牛的最大距离
代码
#include <iostream>
#include <cstdio>
#include <map>
#include <cmath>
#include <string.h>
#include <algorithm>
#include <set>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
const int maxn = 100000+10;
const int INF = 0x3f3f3f3f;
int n,m;
int a[maxn];
bool ok(int d){
int last = 0;
for(int i = 1; i < m;++i){
int crt = last+1;
while(crt < n && a[crt] - a[last] < d){///当前位置不合适
crt++;///看下一个位置
}
if(crt == n) return false; ///都越界了,这头牛还没地方放
last = crt;///z找到合适位置把牛放下
}
return true;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i = 0; i < n ; ++i)
scanf("%d",&a[i]);
sort(a,a+n);
int lb = 0,rb = INF;
while(rb-lb > 1){
int mid = (rb+lb)/2;
if(ok(mid)) lb = mid;
else rb = mid;
}
printf("%d\n",lb);
return 0;
}