Codeforces Round #756 (Div. 3) D. Weights Assignment For Tree Edges

题目链接：Problem - D - Codeforces

You are given a rooted tree consisting of nn vertices. Vertices are numbered from 1 to nn. Any vertex can be the root of a tree.

A tree is a connected undirected graph without cycles. A rooted tree is a tree with a selected vertex, which is called the root.

The tree is specified by an array of ancestors bb containing nn numbers: bibi is an ancestor of the vertex with the number ii. The ancestor of a vertex uu is a vertex that is the next vertex on a simple path from uu to the root. For example, on the simple path from 5 to 3 (the root), the next vertex would be 1, so the ancestor of 5 is 1.

The root has no ancestor, so for it, the value of bibi is ii (the root is the only vertex for which bi=i).

For example, if n=5 and b=[3,1,3,3,1], then the tree looks like this.