POJ 2456

二分查找，将最小距离和最大距离进行二分 

#include<iostream>
#include<algorithm>
using namespace std;

int pos[1000000];
int n, m, best;

int binary_search()
{
	int l = 1, r = pos[n - 1] - pos[0];
	while (l < r)
	{
		int flag = 0;
		int num = 1;
		int cur = pos[0];
		int mid = (l + r) /2;
		for (int i = 1; i < n; i++)
		{
			if (pos[i] - cur >= mid)
			{
				num++;
				cur = pos[i];
			}
			if (num == m)
			{
				flag = 1;
				best = mid;
				break;
			}
		}
		if (flag)
			l = mid + 1;
		else
			r = mid;
	}
	return best;
}

int main()
{
	while (cin >> n >> m)
	{
		for (int i = 0; i < n; i++)
			cin >> pos[i];
		sort(pos, pos + n);
		cout << binary_search() << endl;
	}
}