POJ 3258 二分

题意

传送门 POJ 3258

二分最短距离，将包括起点终点的点集按距离排序，向前搜索，统计需要去除的石头。满足去除石头数小于等于 $M$ 的最大值即答案。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#define min(a,b)    (((a) < (b)) ? (a) : (b))
#define max(a,b)    (((a) > (b)) ? (a) : (b))
#define abs(x)    ((x) < 0 ? -(x) : (x))
#define INF 0x3f3f3f3f
#define delta 0.85
#define eps 1e-5
#define PI 3.14159265358979323846
#define MAX_N 50005
using namespace std;
int L, N, M;
int D[MAX_N];

bool C(int d){
	int cnt = 0, sz = N + 2;
	for(int crt, last = 0; last < sz;){
		crt = last + 1;
		while(crt < sz && D[crt] - D[last] < d) crt++, cnt++;
		last = crt;
	}
	return cnt <= M;
}

int main(){
	while(~scanf("%d%d%d", &L, &N, &M)){
		D[0] = 0, D[N + 1] = L;
		for(int i = 1; i <= N; i++) scanf("%d", D + i);
		sort(D + 1, D + N + 1);
		int lb = 0, ub = L + 1;
		while(ub - lb > 1){
			int mid = (lb + ub) >> 1;
			if(C(mid)) lb = mid;
			else ub = mid;
		}
		printf("%d\n", lb);
	}
	return 0;
}