poj2456 二分搜索

 

 

如题：http://poj.org/problem?id=2456

 

Aggressive cows

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6930		Accepted: 3450

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

USACO 2005 February Gold

 

 

 

思路：设f（d）为是否满足任意两头牛距离大于等于d。在区间0-(X数组最大值*2+1)中搜索满足f的，不断缩小区间，直到r-l<=1

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

int X[100005];
int N,C;
int f(int d)
{
 int i;
 int last=1;
 for(i=1;i<C;i++)
 {
  int now=last+1;
  while(now<=N&&X[now]-X[last]<d)
   now++;
  if(now>N)
   return 0;
  last=now;
 }
 return 1;
}
int main()
{
// freopen("C:\\1.txt","r",stdin);
 cin>>N>>C;
 int i;
 for(i=1;i<=N;i++)
  scanf("%d",&X[i]);
 sort(X+1,X+1+N);
 int l=0,r=X[N]*2+1;
 while(r-l>1)
 {
  int mid=(l+r)/2;
  if(f(mid))
   l=mid;
  else
   r=mid;
 }
 printf("%d\n",l);
}