思路
二分
代码
#include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;
int n,k;
int a[100005]={0};
bool fun(int h)
{
int l = 1;
for(int i = 0; i < k; i++)
{
if(l >= a[i])
l = (h >> 1) + a[i] + 1;
else
{
l += (h >> 1) + 1;
if(l <= a[i])
return false;
}
}
if(l <= n)
return false;
return true;
}
bool com(int x,int y)
{
return x < y;
}
int main()
{
int i = 0;
scanf("%d %d",&n,&k);
for(i = 0;i < k;i++)
scanf("%d",&a[i]);
sort(a,a+k,com);
int l = 0, r = 200000;
int t = -1;
while(l<=r)
{
int h = (l+r)>>1;
if(fun(h))
{
r = h - 1;
t = h;
}
else
l = h + 1;
}
cout<<t<<endl;
return 0;
}