Ka Chang 沈阳网络赛 (树上分块+dfs序时间戳+树状数组 )
Given a rooted tree ( the root is node 11 ) of NN nodes. Initially, each node has zero point.
Then, you need to handle QQ operations. There're two types:
1\ L\ X1 L X: Increase points by XX of all n...
原创
2018-09-11 14:21:40 ·
298 阅读 ·
0 评论