Venue: \ (= 60 + 71 + 131 0 \)
. . . \ (CSP \) first field directly after the explosion. . .
T1:
beginning of the wrong meaning of the questions, then thought of a wrong solution, only to discover later problems do not have time to play a direct wave of violence.
T2:
At first looked at the tree problem is found, then thought to be found in order to find the root node of an answer, after changing the root.
In other root when we only need to maintain at sub-tree for each node of the largest and the second largest chain to chain. Transfer easy. (Burst transfer results ...)
T3:
found that \ (n-\) no eggs used, and \ (m \) and \ (K \) are small. . . (But that does not matter)
then it is easy to think of greed, we enumerate the number of empty then empty the stack which is maintained at optimal (the record about the number of times each bullpen emptied, it must be emptied average optimal ).
Time complexity \ (O (Klogm) \) , people really do not understand the topic and make a \ (O (m * k ^ 2) \) of the solution to a problem is a joke right? (Ha ha）
Summary:
1. To allow sufficient time for playing the title, do not tune out in the end. . .
2. Before playing the code, be sure to think clearly, do not think about it plus an array, and then add an array, I'm sick of it all. . .
3. The meaning of the questions the trial must be clear otherwise. . .
Now: \ (100 + 100 + 100 = 300 \)