原题链接
题目
思路
两人见面后相背而去,可以理解为擦肩而过。
由此分别取最大值和最小值。
代码
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t -- )
{
int l, n;
cin >> l >> n;
int a[n + 10];
int maxn = 0, minn = -0x3f3f3f3f;
for (int i = 1; i <= n; i ++ ) cin >> a[i];
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i ++ )
{
maxn = max(maxn, max(a[i], l - a[i]));
minn = max(minn, min(a[i], l - a[i]));
}
cout << minn << " " << maxn << endl;
}
return 0;
}