上个求助帖沉了 这次发个好玩的

#include<bits/stdc++.h>
using namespace std;
int compare_bigger(int a,int b)
{
    if(a>b)
      return a;
    else
      return b;
}
int main()
{ 
    int l,n,coordinate[5005],min=0,max=0,i,midleft=0,midright=0,t=0;
    cin>>l;
    cin>>n;
    if(n==0)
    {cout<<"0 0";}
    else{
    for(i=0;i<n;i++)
      cin>>coordinate[i];
    for(i=0;i<n;i++)
      {if(coordinate[i]<=l/2) midleft=coordinate[i];
       else {midright=coordinate[i];break;}}///离中点最近的点
    min=compare_bigger(midleft,l+1-midright);
    for(i=0;i<n;i++)
    {
        if(coordinate[i]<=l/2&&t<=(l/2-coordinate[i])) t=l/2-coordinate[i];///离中点最远的点
        if(coordinate[i]>l/2&&t<=coordinate[i]-l/2) t=coordinate[i]-l/2;
    }
    max=t+l/2+1;
    cout<<min<<" "<<max; 
    }
}