E(最大化最小值)
模板题
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#define INF 0x3f3f3f3f
using namespace std;
const int MAXN = 1e5+10;
int P[MAXN];
int N, M;
bool c(int d)
{
int last = 0;
int crt = 0;
for(int i = 1; i < M; i++){
crt = last+1;
while(crt < N && P[crt] - P[last] < d) crt++;
if(crt == N) return false;
last = crt;
}
return true;
}
int main()
{
while(~scanf("%d %d", &N, &M) && (N+M)){
for(int i = 0; i < N; i++)
scanf("%d", &P[i]);
sort(P, P+N);
int st = 0, ed = INF;
int mid = 0;
while(ed - st > 1){
mid = (st+ed)/2;
if(c(mid)) st = mid;
else ed = mid;
}
printf("%d\n", st);
}
return 0;
}