ACM-ICPC 2017 Asia HongKong - E （二分答案）

5G is the proposed next telecommunications standards beyond the current $4G$ standards. $5G$ planning aims at higher capacity than current $4G$, allowing a higher density of mobile broadband users, and supporting device-to- device, reliable, and massive wireless communications. $A$telecommunication company would like to install more base stations to provide better communication for customers. Due to the installation cost and available locations, the company can only install $S(2\le S\le L)$base stations at $L(2\le L\le 100,000)$candidate locations. Since the base stations work in the same frequency band, they will interfere and cause severe performance degradation. To provide high quality communication experience to customers, the company would like to maximize the distance between the base stations so as to reduce the wireless interference among the base stations. Suppose the L candidate locations are in a straight line at locations P1,P2,...,PL(0≤Pi≤1,000,000)P1​,P2​,...,PL(0≤Pi≤1,000,000) and the company wants to install $S$ base stations at the $L$ candidate locations. What is the largest minimum distance among the $S$ base stations?

Input

The input data includes multiple test sets.

Each set starts with a line which specifies $L$ ($i.e.$, the number of candidate locations) and $S$ ($i.e.$, the number of base stations). The next line contains $L$ space-separated integers which represent P1P1​ , P2P2​ , ... , PLPL​ . The input data ends “$0$ $0$”.

Output

For each set, you need to output a single line which should be the largest minimum distance among the base stations.

For the first set, the $3$ base stations can be installed at locations $2,6,11$.

样例输入

5 3
2 3 9 6 11
4 3
1 4 9 10
0 0

样例输出

4
3

题目来源

ACM-ICPC 2017 Asia HongKong

题意：

有L个数，从中选出S个数，使得任意两个数差的绝对值 的 最小值 最大

求最大值

二分答案，假设答案已知，判断答案是否符合条件

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
int S,L,a[N];
int main()
{
    while(scanf("%d%d",&L,&S)&&L+S){
        for(int i=0;i<L;i++) scanf("%d",&a[i]);
        sort(a,a+L);
        int l = 0, r = 1e6,mid;
        while(l<=r){
            mid = (l+r)>>1;
            int cnt = 1, now = 0;
            for(int i=1;i<L;i++){
                if(a[i]-a[now]>=mid){
                    now = i; cnt++;
                }
            }
            if(cnt>=S) l = mid + 1;
            else r = mid - 1;
        }
        printf("%d\n",l-1);
    }
    return 0;
}