题目:
http://poj.org/problem?id=3258
题意:
已知河长len(1 ≤ L ≤ 1,000,000,000), n个石头与起点的距离, 求出拿去m个石头后,石头间最小距离的最大值.
思路:
二分, 将起始右值设为MAX_L+1, 左值为0, 每二分一次判断mid的正确性.
CODE:
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int INF = 1e9 + 1;
int dis[50005], len, n, m;
bool cor(int d)
{
int tmp = 0;
for(int i = 1; i < m; ++i) { //i从1开始是因为开头位置的石头是固定的,不需要算进去.
int cnt = tmp + 1;
while(cnt < n && dis[cnt] - dis[tmp] < d) {
cnt++;
}
if(cnt == n) return 0;
tmp = cnt;
}
return true;
}
void solve()
{
sort(dis, dis + n);
int l = 0, r = INF;
while(r - l > 1) {
int mid = (l + r) / 2;
if(cor(mid)) l = mid;
else r = mid;
}
printf("%d\n", l);
}
int main()
{
//freopen("in", "r", stdin);
while(~scanf("%d %d %d", &len, &n, &m)) {
for(int i = 0; i < n; ++i) {
scanf("%d", &dis[i]);
}
dis[n++] = 0; dis[n++] = len;
m = n - m;
solve();
}
return 0;
}