我用python编写 L = int(input()) N = int(input()) pos = list(map(int, input().split()))

统计每个坐标出现的次数

count = [0] * (L + 2) for p in pos: count[p] += 1

统计每个士兵的方向

direction = [0] * N for i in range(N): if pos[i] == 1: direction[i] = 1 elif pos[i] == L: direction[i] = -1 else: direction[i] = 0

统计每个士兵的最远距离

max_distance = [0] * N for i in range(N): if direction[i] == 1: max_distance[i] = L - pos[i] elif direction[i] == -1: max_distance[i] = pos[i] - 1 else: max_distance[i] = 0

统计最小时间和最大时间

min_time = 0 max_time = 0 for i in range(N): if direction[i] == 1: min_time += max_distance[i] max_time += max_distance[i] elif direction[i] == -1: min_time += max_distance[i] max_time += max_distance[i] else: min_time += max_distance[i] - 1 max_time += max_distance[i] + 1

print(min_time, max_time) 为pycharm运行的结果符合题目给出的输入输出样例，但是洛谷上会给0分