POJ-3258

二分搜索经典应用，二分最小距离，看看remove几个石头能达到这个条件，如果多于M个的话就不符合，降低上界，否则提高下界

#include<cstdio>
#include<algorithm>

using namespace std;

namespace
{
	int L, N, M, d[50005];

	bool check(int dis)
	{
		int prev = 0, res = 0;
		for (int i = 1; i <= N + 1; i++)
		{
			if (d[i] - d[prev] < dis)
				res++;
			else
				prev = i;
			if (res > M)
				return false;
		}
		return true;
	}

	void solve()
	{
		sort(d, d + N + 1);
		d[N + 1] = L;
		int lb = 0, rb = L + 1, mid;
		while (rb - lb > 1)
		{
			mid = (lb + rb) / 2;
			if (check(mid))
				lb = mid;
			else
				rb = mid;
		}
		printf("%d\n", lb);
	}
}

int main()
{
	scanf("%d %d %d", &L, &N, &M);
	d[0] = 0;
	for (int i = 1; i <= N; i++)
		scanf("%d", &d[i]);
	solve();
	return 0;
}