POJ3258 River Hopscotch二分

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[50002];
int l,n,m;
bool pan(int x)
{
	int count=0;
	int front=0,rear=1;
	for(;rear<=n+1;)
		if(a[rear]-a[front]<x)
		{
		    rear++;
		    count++;			
		}
		else
		{
		    front=rear++;
		}
	if(count>m)return false;
	return true;
}

int main()
{
	//freopen("t.txt","r",stdin);
	int i,k,u;
	int  front,mid,rear;
	while(scanf("%d%d%d",&l,&n,&m)!=EOF)
	{

		front=l;rear=l;
		for(i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
		}
		a[n+1]=l;a[0]=0;
		sort(a,a+n+1);
		front=0;
		while(front<rear)
		{
			mid=rear+(front-rear)/2;
			if(pan(mid))front=mid;
			else rear=mid-1;
		}
		printf("%d\n",front);
	}
	return 0;
}