Comments
On AmirrzwM → Codeforces Global Round 23, 4 years ago
+62

Maybe because I am not good at math and interactive.
On AmirrzwM → Codeforces Global Round 23, 4 years ago
+90

Only I think F much easier than E1 and E1 much easier than E2?
+8

The author is not from china, is other place this problem?
+12

The input and output format not same.
+17

I don't think this will make difference.
On dario2994 → About div1E (round #810), 4 years ago
+20

I think the decisive factor should be how many people AC the problem not rely on their effort in the contest.
+34

But need quite code capability.
+33

E and F, it is natural to think of dp. And one using data structure another using FFT to optimize the transition.

+51

I mean compare with other div2 contest, this one is quite boring.
+71

No difficulty of thinking, but coding. A boring competition.
On Mangooste → Global Round 19 Editorial, 4 years ago
+47

By the way, the discrimination of this round is not good, maybe the reason is that the difficulty in thinking in problem E and F is insufficient.
On Mangooste → Global Round 19 Editorial, 4 years ago
+31

For problem F, if we enumerate one of the biggest height node, then the contribution of node i (i is not the biggest node we determine） is max(0,h[i]-(the maximum h of the node except the node in the subtree of the biggest node when the root is i and i itself). We first determine the root of the tree, then my solution is to calculate up[i] and down[i], it means if the biggest node in the subtree of i, what the contribution will be for node father[i] and if the biggest node not in the subtree of i, what the contribution will be for node i. Then we can easily calculate the answer.