This is a very simple problem. We build a tree according to the question.

Specifically, we connect \(a_i\) to \(i\) and \(i+1\).

And then we dfs the whole tree to find the depth of each node.