# 简单二分

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

，一道二分题，因为xi的是从0到1e9的，所以以这两个数据为二分的起始左右数据l和r，求出中间值mid，带入自己写的判断函数中，若这个数满足题意，令l＝mid，否则r=mid；

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>

using namespace std;

int n,c,xi[100010];

int judge(int a)
{
int b=0,num=1;
for(int i=0;i<n;i++)
{
if(xi[i]-xi[b]>=a)
{
num++;
b=i;
}
}
if(num>=c) return 1;
else return 0;
}

int main()
{
cin>>n>>c;
for(int i=0;i<n;i++) cin>>xi[i];
sort(xi,xi+n);
int left=xi[0],right=xi[n-1];
int mid=(left+right)/2;
while(left+1<right)
{
if(judge(mid)) left=mid;
else right=mid;
mid=(left+right)/2;
}
cout<<left;

return 0;
}


©️2019 CSDN 皮肤主题: 数字20 设计师: CSDN官方博客