Ants are indistinguishable. Thus, when they collide and turn back, the state is the same as no collision: the ants walking through each other. Using this trick, just find the longest distance that an ant walks.

Time complexity

$\mathcal{O}(N)$, $N$ is the number of ants.

Problem

Read the problem.