计蒜客 Ka Chang（2018 ICPC亚洲区域赛网络赛 沈阳 J）（分块+DFS序+树状数组）

Given a rooted tree ( the root is node 11 ) of NN nodes. Initially, each node has zero point.node Then, you need to handle QQ operations. There're two types:ios 1\ L\ X1 L X: Increase points by XX of

>>阅读原文<<