#include<iostream>
using namespace std;
const int MAXN = 1000005;
int L;
int x[MAXN];
int t;
int n;
void solve();
int main(){
scanf("%d",&t);
scanf("%d %d",&L,&n);
for(int i = 0; i< t; i++){
for(int j = 0;j < n; j++){
scanf("%d",&x[j]);
}
solve();
}
return 0;
}
void solve(){
int minT = 0;
for(int i = 0; i < n;i++){
minT = max(minT, min(x[i],L - x[i]));
}
int maxT = 0;
for(int i = 0; i < n;i++){
maxT = max(maxT, max(x[i],L - x[i]));
}
printf("%d %d\n",minT,maxT);
}
挑战程序设计竞赛
最新推荐文章于 2022-09-08 11:06:57 发布