poj 1852

#include <iostream>#include <algorithm>#include <cstdio>int main(){using namespace std;intnum_case;cin >> num_case;while (num_case--) {intlenght, n;cin >> lenght >> n;int*pos = new int [n];inti(0);for (i = 0; i < n; ++i) {cin >> pos[i];}int minT(0);for (i = 0; i < n; ++i) {minT = max(minT, min(pos[i], lenght - pos[i]));}int maxT(0);for (i = 0; i < n; ++i) {maxT = max(maxT, max(pos[i], lenght - pos[i]));}cout << minT << " " << maxT << endl;delete pos;}}