hiho! is a serial contests we developed to help programmers improve their skills following some architecture. Tree, as a data structure, has a significant feature that the problem on a tree usually can be divided in to several sub-problems on sub-trees which is very similar to what we have learned in "Dynamic Programming".
From this week, we will begin from the RMQ problem which metioned before, discussing about a series of "Queries/Modifies" problem that solved by tree-struct, such as segment-tree, tree-like array and balanced tree. So are you ready for this?