2456:Aggressive cows
查看提交统计提示提问
总时间限制:
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.
来源
USACO 2005 February Gold
二分思想
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iomanip>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>
using namespace std;
int n,c;
int a[100005];
bool Isok(int x)
{
int sum=0,s=1;
for(int i=1;i<n;++i)
{
if(sum+a[i]-a[i-1]<x)
{
sum+=a[i]-a[i-1];
}
else
{
sum=0;
s++;
}
}
if(s>=c)return true;
return false;
}
int main()
{
scanf("%d%d",&n,&c);
for(int i=0;i<n;++i)
{
scanf("%d",&a[i]);
}
sort(a,a+n);
int l=0,r=a[n-1];
while(l<=r)
{
int mid=(l+r)/2;
if(Isok(mid))
{
l=mid+1;
}
else
{
r=mid-1;
}
}
printf("%d\n",r);
return 0;
}
