#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; #define maxn 100000 int main(){ int L, n, t; int a[maxn]; scanf("%d", &t); while(t--){ scanf("%d%d", &L, &n); for(int i=0; i<n; i++) scanf("%d", &a[i]); int mn = 0; //求最短时间 for(int i=0; i<n; i++) mn = max(mn, min(a[i], L - a[i])); int mx = 0; //求最长时间 for(int i=0; i<n; i++) mx = max(mx, max(a[i], L - a[i])); printf("%d %d\n", mn, mx); } return 0; }
个人代码托管,一个问题的解答
2016-06-14 20:51:07 来源:慕课网