这道题是道超级无敌水的模拟,话不多说,直接上代码:
#include<iostream>
#include<algorithm>
#include<cmath>
int l,n,a[5001],b[5001],x;
using namespace std;
int main()
{
cin>>l>>n;
for (int i=1;i<=n;i++)
{
cin>>x;
a[i]=min(x,l-x+1);
b[i]=max(x,l-x+1);
}
sort(a+1,a+n+1);
sort(b+1,b+n+1);
cout<<a[n]<<" "<<b[n];
}