poj 3258 River Hopscotch（二分搜索）

参考：http://www.hankcs.com/program/cpp/poj-3258-river-hopscotch.html
看的同一本书，参考的同一道题，然而我却做错了，iq不够用啊。。。

#include <cstdio>
#include <cstring>
#include <climits>
#include <algorithm>
using namespace std;

int l,n,m;
const int MAXN = 50010;
int num[MAXN];

bool C(int d)
{
    int last = 0;
    for(int i = 1; i < n-m; ++i)
    {
        int crt = last + 1;
        while(crt < n && num[crt]-num[last] < d)
            ++crt;
        if(crt == n) return false;
        last = crt;

    }
    return true;
}

int main()
{
    while(scanf("%d %d %d",&l,&n,&m) != EOF)
    {
        for(int i = 1; i <= n; ++i)
            scanf("%d",&num[i]);
        num[++n] = l;
        ++n;
        sort(num,num+n);
        int lb = 0, ub = l+1;
        while(ub - lb > 1)
        {
            int mid = (lb + ub)/2;
            if(C(mid)) lb = mid;
            else ub = mid;
        }
        printf("%d\n",lb);
    }
    return 0;
}