Shortest Distances 101

You are given a directed graph with $N$ nodes numbered $1$ to $N$, and an array $A$ of size $N$. The graph is such that there is an edge directed from node $i$ to node $(i + j)$ for all $1 \le j \le A_i$. No other edges are present in the graph. Handle $Q$ queries of the form: - Given nodes $X$ and $Y$, find the minimum number of edges on a path from node $X$ to node $Y$. If it is impossible to g