链接:http://poj.org/problem?id=2456
Language:
Aggressive cows
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? 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. Source |
先排序,然后二分枚举所有的距离,判断最小距离时可用贪心。
#include<iostream>
#include<algorithm>
using namespace std;
int room[100000+5];
int n,m;
bool cmp(int a,int b)
{
return a<b;
}
bool judge(int a)
{
int next=1,now=0;
for(int i=1;i<m;i++)//分割成m-1部分即可
{
next++;
while(next<n&&room[next]-room[now]<a) //贪心,a为最小距离分割,跳过小于a距离的点
next++;
if(next==n) return false;
now=next;//当前结束点为下一次的新的起点
}
return true;
}
int main()
{
int a,r,l,mid;
while(scanf("%d%d",&n,&m)!=EOF)
{
for(a=0;a<n;a++)
scanf("%d",&room[a]);
sort(room,room+n);
l=room[0],r=room[n-1]+1;
while(r-l>1)//找最小距离,用二分来枚举
{
mid=(r+l)/2;
if(judge(mid)) l=mid;
else r=mid;
}
printf("%d\n",l);
}
return 0;
}