poj 3258 River Hopscotch

这次写的二分代码有问题，wa了无数次，最后稀里糊涂的A了，请勿参考本菜代码

#include <iostream>
#include <fstream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <ctime>
#define LL long long
#define Vi vector<int>
#define Si set<int>
#define readf freopen("input.txt","r",stdin)
#define writef freopen("output.txt","w",stdout)
#define FU(i,a) for(int i(1); i <= (a); i++)
#define FD(i,a) for(int i(a); i >= (1); i--)
#define FOR(i,a,b) for(int i(a);i <= (b); i++)
#define FORD(i,a,b) for(int i(a);i >= (b); i--)
#define SET(a,b) memset(a,b,sizeof(a))
#define SD(a) scanf("%d",&(a))
#define LN printf("\n")
#define PS printf(" ")
#define pb push_back
using namespace std;
const int maxn=50002;
int L,N,M,low,high,mid;
int a[maxn];
bool solve(int k)
{
    int start=0,sum=0;
    FOR(i,1,N+1)
    {
        if(a[i]-start<=mid)  sum++;
        else start=a[i];
    }
    if(sum>M) return false;
    else  return true;

}
int main(){
    SD(L);SD(N);SD(M);
    high=L,low=0;;
    FOR(i,1,N) SD(a[i]);
    a[N+1]=L;
    sort(a+1,a+N+1);
    while(low<=high){
        mid=(low+high)/2;
        if(!solve(mid))
            high=mid-1;
        else
            low=mid+1;
    }
    printf("%d\n",low);
    return 0;
}