Skiing

Skier starts at $(0,0)$ with constant $v_y$ downhill. Lateral acceleration is bounded by $a_{max}$. Visit the longest possible sequence of targets.

$n$, $v_y$, $a_{max}$, then $n$ target coordinates.

Target indices visited, lexicographically smallest among maximum length. Or Cannot visit any targets.