显示代码纯文本
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstdlib>
#include <ctime>
#include <sstream>
#include <queue>
#include <set>
#include <map>
using namespace std;
const int maxn=1000000+10;
const int maxm=1000+10;
int n,m,ans;
int k;
int a[maxn];
int main()
{
freopen("teststr.in","r",stdin);
freopen("teststr.out","w",stdout);
cin>>n>>k;
for(int i=1;i<=k; i++)
{
scanf("%d",&a[i]);
}
sort(a+1,a+k+1);
ans=max(a[1],n-a[k]);
for(int i=2;i<=k;i++)
{
ans=max(ans,(a[i]-a[i-1])/2);
}
cout<<ans<<endl;
return 0;
}