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".
The segment sometimes used for maintain more than one thing, even the lazy tag used to help is more than just one. In this case, the situation will become complicated, like the overlag between tags ! So, let's see how Hi and Ho solve it !