I am unable to understand the solution provided in the editorial of this problem. I read the explanations in the comments but can't seem to understand them either.
Specifically, I am stuck on this part of the editorial —
"For every arrangement, the minimizing player can guarantee himself the result of at most $ dp_{min}(v) = 1 + \sum\limits_{i=1}^k dp_{max} (u_i) — 1 $"
I don't see the logic behind this formula.
Also in the editorial dpmax(v) is given as 
but in the sample solution 10973864 it is given as 
. How is that the same?
I have been at this for hours now! Can someone please help me? Thank you! :)
