POJ 3258 River Hopscotch

POJ 3258 River Hopscotch

思路：二分最小距离。

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define pb push_back
#define mem(a,b) memset(a,b,sizeof(a))

const int N=5e4+5;
const int INF=0x3f3f3f3f;
int a[N]={0};
int l,n,m;

bool check(ll v)
{
    int cnt=0,pre=0;
    for(int i=1;i<=n+1;)
    {
        if(a[i]-a[pre]>=v)
        {
            pre=i;
            i++;
        }
        else
        {
            cnt++;
            i++;
        }
    }
    
    if(cnt>m)return false;
    else return true; 
}

ll binasrch(ll l,ll r)
{
    ll mid=(l+r)>>1;
    while(l<r-1)
    {
        if(check(mid))l=mid;
        else r=mid;
        mid=(l+r)>>1;
        //cout<<l<<' '<<r<<endl;
    }
    return mid;
}


int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    cin>>l>>n>>m;
    for(int i=1;i<=n;i++)cin>>a[i];
    sort(a+1,a+n+1);
    a[n+1]=l;
    
    int ans=binasrch(0,2*l);
    cout<<ans<<endl;
    return 0;
}