Hiho! is a serial contests we developed to help programmers improve their skills following some architecture. Tree, as a data struct, its most significant feature is that it can be divide in to several problem simply by its natural form, which it's similar to what we have told in "Dynamic Programming".
This week is the "Out of Topic Time!" again. In order to introduce online algorithm of LCA problem, we first introduce the RMG - Range Minimum/Maximum Query. A good method to solve this problem is the ST algorithm. It uses the features of the problem itself and binary thought, make it very easy to write the algorithm. So come and learn it with Hi and Ho.