Poj1852

 1 #include <iostream>
 2 
 3 using namespace std;
 4 
 5 int main()
 6 {
 7     int t;
 8     cin >> t;
 9     while(t--)
10     {
11         int len, ants, sum = 0;
12         int min_t = 0, max_t = 0;
13         cin >> len >> ants;
14         int length;
15         for(int i = 1; i <= ants; i++)
16         {
17             cin >> length;
18             min_t = max(min_t, min(length, len-length));///停留在木棒上，可能用的最短时间的最大值
19             max_t = max(max_t, max(length, len-length));///可能的最大时间的最大值
20         }
21 
22         cout << min_t << " " << max_t << endl;
23     }
24     return 0;
25 }