跳石头——NOIP2015提高组

#include <iostream>

using namespace std;

const int N = 50010;

int L, n, m;
int d[N];

bool check(int mid)
{
    int last = 0, cnt = 0;
    for (int i = 1; i <= n; i ++ )
        if (d[i] - last < mid) cnt ++ ;//把d[i]移走
        else last = d[i];//更新成当前这块
 
    return cnt <= m;
}

int main()
{
    scanf("%d%d%d", &L, &n, &m);
    for (int i = 1; i <= n; i ++ ) cin >> d[i];
    d[ ++ n] = L;
    
    int l = 0, r = 1e9;
    while (l < r)
    {
        int mid = l + r + 1 >> 1;
        if (check(mid)) l = mid;
        else r = mid - 1;
    }
    printf("%d\n", r);
    return 0;
}