【题解】LuoGu3853：[TJOI2007]路标设置

原题传送门
二分+贪心
对于两个路标$l,r$，之间最少放$\frac{r-l-1}{mid}$个

Code：

#include <bits/stdc++.h>
#define maxn 100010
using namespace std;
int a[maxn], L, n, k;

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48) ;
	return s * w;
}

bool check(int mid){
	int cnt = 0; //printf("%d %d\n", mid, cnt);
	for (int i = 2; i <= n; ++i) cnt += max((a[i] - a[i - 1] - 1) / mid, 0);
	return cnt <= k;
}

int main(){
	L = read(), n = read(), k = read();
	for (int i = 1; i <= n; ++i) a[i] = read();
//	sort(a + 1, a + 1 + n);
	int l = 0, r = L, ans;
	while (l <= r){
		int mid = (l + r) >> 1;
		if (check(mid)) ans = mid, r = mid - 1; else l = mid + 1;
	}
	printf("%d\n", ans);
	return 0;
}