Maximum distance to station Looking at the following hackerrank problem:
https://www.hackerrank.com/challenges/flatland-space-stations
You are given a number n where cities can be at indices 0 to n-1 and also given an unsorted list of indices of cities where there are stations. The goal is to find the maximum distance from a city to a station. For example, for n=5 and the station list [0,4], the answer would be 2 since index 2 is 2 away from both 0 and 4 and all other stations at indices 0-4 are closer to one of 0 or 4.
I was looking for a short Python3 solution. The function body takes in the number n and a list c (like [0,4] in the example). After some revisions, I came up with the 69 character function body below:
c.sort();return max(t-s for s,t in zip([-c[0]]+c,c+[2*n-c[-1]-1]))//2

Curious about whether anyone can come up with a shorter body.
Distance solution:
Python 3, 52 Bytes

return max(min(abs(l-c)for l in s)for c in range(n))

Try it online!
Index solution (added after my first two comments):

Python 3, 59 bytes

return max((min(abs(l-c)for l in s),c)for c in range(n))[1]

Try it online!
 
Edit: Switched back to Distance solution,
Thanks to Jonathan Allan for -1 Byte