@@ -0,0 +1,624 @@
+#!/bin/python3%0A%0Aimport sys%0A%0Adef solution(cityCount, stations):%0A    stationIndex = 0%0A    distances    = %5B%5D%0A%0A    for city in range(cityCount):%0A        east = stations%5BstationIndex%5D%0A        west = stations%5BstationIndex - 1%5D if stationIndex %3E 0 else east%0A        %0A        distEast = abs(city - east)%0A        distWest = abs(city - west)%0A%0A        distances.append(min(distEast, distWest))%0A%0A        if distWest %3E= distEast and stationIndex + 1 %3C len(stations):%0A            stationIndex += 1%0A%0A    return distances%0A%0An, m = map(int, input().split())%0Ac    = list(map(int, input().split()))%0Ad    = solution(n, sorted(c))%0A%0Aprint(max(d))%0A

Create solution.py