You can compute for all pairs of of snakes $i$ and $j$, the minimum separation needed between the two snakes assuming snake $j$ will be placed after $i$ in the strip. You can then run a TSP-like DP.