farthest reach
RU: самая дальняя достижимая позиция
In the greedy jump-style problem, the single number tracked during a left-to-right sweep: the farthest position you could possibly be standing on so far. If this frontier falls behind the current position, you are stranded; no path enumeration is needed.