poj 1825 Ants 水题

#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define maxn 1000001
#define eps 1e-9
const int inf=0x7fffffff;   //无限大
int x[maxn];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int l,n;
        scanf("%d%d",&l,&n);
        int min_num=inf;
        int max_num=0;
        int min_ans=0;
        int max_ans=0;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&x[i]);
            min_num=min(x[i],l-x[i]);
            //cout<<min_num<<endl;
            min_ans=max(min_num,min_ans);
            max_num=max(max_num,max(x[i],l-x[i]));
        }
        cout<<min_ans<<" "<<max_num<<endl;
    }
    return 0;
}