https://codeforces.com/contest/1287/problem/D

Evlampiy was gifted a rooted tree. The vertices of the tree are numbered from 1 to n. Each of its vertices also has an integer ai written on it. For each vertex i, Evlampiy calculated ci — the number of vertices j in the subtree of vertex i, such that aj<ai.


그림에는 ai 랑 ci가 적혀 있는거잖아? 맨 위에 있는 ci는 밑에 4개 달려있으니까 4가 돼야하는거 아님? 왜 1임?