Hi, 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 
"
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! :)
UPD - I have solved the problem using the method described here. But I would still like to know how the author's implementation is working since in the solution I implemented is different. In my submission, in one dfs we use the notation of dp(v) = k, being the k'th smallest value and in the other iteration as the k'th largest value, but in the author's solution, it seems to me that he has used the notation dp(v) = k as the k'th smallest value in both the cases. If so then can someone please clarify the transitions made by the author?
