E - River Hopscotch

https://vjudge.net/contest/256497#problem/G

/***********最大化最短距离，怕少不怕多************/
#include <iostream>
#include   <cstring>
#include   <cstdlib>
#include    <cctype>
#include    <cstdio>
#include    <string>
#include <algorithm>
using namespace std;
long long L,a[50050];
int m,n;
bool sloved(long long mid){
    long long cnt=1;
    long long sum=0;
    for(int i=1;i<=n+1;i++){
        sum+=a[i]-a[i-1];
        if(sum>=mid){
            sum=0;
            cnt++;
        }
    }
    if(n+2-m<=cnt)return 1;
    return 0;
}
int main()
{
    scanf("%I64d%d%d",&L,&n,&m);
    a[0]=0;
    long long mini=L;
    for(int i=1;i<=n;i++){
        scanf("%I64d",&a[i]);
        mini=min(mini,a[i]-a[i-1]);
    }
    a[n+1]=L;
    mini=min(mini,a[n+1]-a[n]);
    sort(a+1,a+n+1);
    long long l=mini;
    long long r=L;
    long long mid;
    long long ans=0;
    while (l<=r){
        mid=(l+r)/2;
        if(sloved(mid)){
            ans=mid;
            l=mid+1;
        }else{
            r=mid-1;
        }
    }
    cout << ans << endl;

    //cout << "Hello world!" << endl;

    return 0;

}