#include<iostream>
using namespace std;
int n, L, x[999999];
int main()
{
int mmax = 0;
cin>>L>>n;
for(int i = 0; i < n; i++)
cin>>x[i];
int mmin = 0;
for(int i = 0; i < n; i++)
{
mmin = max(mmin, min(x[i], L- x[i]));
}
for(int i = 0; i < n; i++)
{
mmax = max(mmax, max(x[i], L- x[i]));
}
cout<<"min = "<<mmin<<endl;
cout<<"max = "<<mmax<<endl;
return 0;
}
上面是算法书上的题目下面是我的代码