## Codeforces Global Round 16(A - E)

A. Median Maximization
The simple greedy construction question is intended to find the maximum median. If all the numbers in the known sequence are non negative, we can make all the numbers before the median zero, and then the median can get the maximum total divided by the remaining numbers and rounded down code
#include <bits/stdc++.h> ...

Posted on *Mon, 13 Sep 2021 22:50:12 -0400* by **zerogreen**

## Codeforces Global Round 16 Questions

E. Buds Re-hanging
Topic:
Given a multifork tree, a node is defined as a "tree bud". The condition is:
Not root nodeContains at least one child nodeAll child nodes are leaf nodes.
Now you can do one thing: graft the bud node and all its children onto another node.
Question: If you can do any of the above operations, what is the m ...

Posted on *Mon, 13 Sep 2021 13:52:32 -0400* by **nec9716**