你没有考虑当士兵为1个的情况，你想要AC的话，可以特判一下该情况。 再发个代码给你看看,祝你成功！：
````cpp
#include<cstdio>
#include<algorithm>
using namespace std;
int a[10005];
int main(){
int l = 0, n = 0, slow = 0, fast = 0,slow1 = 0, fast1 = 0;
scanf("%d%d", &l, &n);
for(int i = 1; i <= n; i ++){
int p = 0;
scanf("%d", &p);
fast = min(p, l - p + 1);
slow = max(p, l - p + 1);
fast1 = max(fast, fast1);
slow1 = max(slow, slow1);
}
printf("%d %d", fast1, slow1);
return 0;
}
by Gausswing @ 2023-10-05 15:33:07
@[Gausswing](/user/1103540) 谢谢！
by mjnd @ 2023-10-15 09:55:34
不用谢！ @[mjnd](/user/919640)
by Gausswing @ 2023-10-15 10:13:03