River Hopscotch POJ - 3258(最小值最大化 二分)

Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a rock at the start and another rock at the end, L units away from the start (1 ≤ L ≤ 1,000,000,000). Along the river between the starting and ending rocks, N (0 ≤ N ≤ 50,000) more rocks appear, each at an integral distance Di from the start (0 < Di < L).

To play the game, each cow in turn starts at the starting rock and tries to reach the finish at the ending rock, jumping only from rock to rock. Of course, less agile cows never make it to the final rock, ending up instead in the river.

Farmer John is proud of his cows and watches this event each year. But as time goes by, he tires of watching the timid cows of the other farmers limp across the short distances between rocks placed too closely together. He plans to remove several rocks in order to increase the shortest distance a cow will have to jump to reach the end. He knows he cannot remove the starting and ending rocks, but he calculates that he has enough resources to remove up to M rocks (0 ≤ M ≤ N).

FJ wants to know exactly how much he can increase the shortest distance before he starts removing the rocks. Help Farmer John determine the greatest possible shortest distance a cow has to jump after removing the optimal set of M rocks.

Input
Line 1: Three space-separated integers: L, N, and M
Lines 2… N+1: Each line contains a single integer indicating how far some rock is away from the starting rock. No two rocks share the same position.
Output
Line 1: A single integer that is the maximum of the shortest distance a cow has to jump after removing M rocks
Sample Input
25 5 2
2
14
11
21
17
Sample Output
4
Hint
Before removing any rocks, the shortest jump was a jump of 2 from 0 (the start) to 2. After removing the rocks at 2 and 14, the shortest required jump is a jump of 4 (from 17 to 21 or from 21 to 25).
最小值最大化，二分的典型题。不断的去二分答案，判断需要拆除的石头块数和m的关系。设置两个指针移动。
代码如下：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define ll long long
using namespace std;

const int maxx=5e4+100;
int a[maxx];
int n,m,e;

inline bool judge(int x)
{
	int i=1,j=0;
	int cnt=0;
	int flag=1;
	for(;i<=n;i++)
	{
		if(flag) j=i-1;
		if(a[i]-a[j]<x) cnt++,flag=0;//如果当前石头拆除了，后面的那个指针就不用动。
		else flag=1;
	}
	if(cnt<=m) return 1;//拆除的石头个数小于等于m，就返回1
	return 0;
}
int main()
{
	scanf("%d%d%d",&e,&n,&m);
	a[0]=0;
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	a[n+1]=e;
	n++;
	sort(a,a+1+n);
	//for(int i=0;i<=n;i++) cout<<a[i]<<endl; 
	int l=1,r=100000001;
	int mid,ans=0;
	while(l<=r)
	{
		mid=l+r>>1;
		if(judge(mid))
		{
			ans=mid;
			l=mid+1;
		}
		else r=mid-1;
	}
	printf("%d\n",ans);
	return 0;
}

努力加油a啊，(^o)/~