洛谷 UVA 10714 Ants
#include <iostream>
#include <cmath>
using namespce std;
int main () {
int t;
cin >> t;
while (t--) {
int l, n, x[100005], mint = 0, maxt = 0;
cin >> l >> n;
for (int i = 0; i < n; i++) {
cin >> x[i];
mint = max(mint, min(x[i], l - x[i]));
maxt = max(maxt, max(x[i], l - x[i]));
}
cout << mint << ' ' << maxt << endl;
}
return 0;
}