poj之旅——3258C++

#include<cstdio>
#include<algorithm>
#define maxn 51000
using namespace std;
int p[maxn];
int L,n,m;
bool Check(int k){
int last=0,cnt=0;
for (int i=0;i<n;i++)
if (p[i]-last<k)cnt++;
else last=p[i];
return cnt<=m;
}
int main(){
scanf("%d%d%d",&L,&n,&m);
for (int i=0;i<n;i++)scanf("%d",&p[i]);
p[n++]=L;
sort(p,p+n);
int l=0,r=L+1;
while (l+1<r){
int mid=(l+r)>>1;
if (Check(mid))l=mid;
else r=mid;
}
printf("%d",l);
return 0;
}