#include<bits/stdc++.h>
using namespace std;intmain(){int S, L, p[1000000];while(1){scanf("%d%d",&L,&S);if(L + S ==0)break;for(int i =0; i < L; i++){scanf("%d",&p[i]);}sort(p, p + L);int left =0, right =1e6, mid;while(left <= right){
mid =(left + right)/2;int count =1, pos =0;for(int i =1; i < L; i++){if(p[i]- p[pos]>= mid){
pos = i;
count++;}}if(count >= S)
left = mid +1;else
right = mid -1;}printf("%d\n", left -1);}return0;}
The 2017 ACM-ICPC Asia Hong Kong Regional Contest E Base Station Sites 复现 题解题目题意代码思路总结题目同样与F一样,是在社团oj上做的题目。原题链接题意在L个距离点中选出S个放置基站,并且要求基站之间的最小距离的极限值。代码#include <bits/stdc++.h>using na...