Leetcode 3243. Shortest Distance After Road Addition Queries I

Given n nodes initially connected by the directed path 0→1→...→n-1, process incremental additions of forward edges (u→v with u<v) and after each addition report the shortest path length from 0 to n-1. The core challenge is maintaining/updating the shortest-path distance in this DAG under up to 500 edge insertions efficiently.