POJ 1852 Ants

 1 #include <cstdio>
 2 #include <algorithm>
 3 using namespace std;
 4 
 5 int main()
 6 {
 7     int t;
 8     scanf("%d", &t);
 9     while(t--){
10         int len, n;
11         scanf("%d%d", &len, &n);
12         int minT = 0, maxT = 0;
13         int pos;
14         while(n--){
15             scanf("%d", &pos);
16             minT = max(minT, min(pos, len-pos));
17             maxT = max(maxT, max(pos, len-pos));
18         }
19         printf("%d %d\n", minT, maxT);
20     }
21     return 0;
22 }