Aggressive cows--（二分）

Aggressive cows

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 32   Accepted Submission(s) : 11

Problem 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 <br> <br>* 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 312849

 

Sample Output

3

代码：

#include<iostream>#include<string>#include<cstdio>#include<algorithm>#include<cmath>#include<iomanip>#include<queue>#include<cstring>#include<map>using namespace std;int a[100010];int main(){    int i,n,m,temp,num;    scanf("%d%d",&n,&m);    for(i=0;i<n;i++)        scanf("%d",&a[i]);    sort(a,a+n);    int left,right,mid;    left=0; right=1000000002;    while(left<right)    {        mid=(left+right)/2;        num=1; temp=a[0];        for(i=1;i<n;i++)        {            if(a[i]-temp>mid) {num++; temp=a[i];}  //注意是大于号不是大于等于号        }        if(num>=m) left=mid+1;        else right=mid;    }    printf("%d",left);    return 0;}