(银牌题)ACM-ICPC 2018 沈阳赛区网络预赛 J - Ka Chang dfs时间戳+树状数组+二分+分块
博客目录
原题
题目传送门
18.55%
1000ms
131072K
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...
原创
2018-09-29 12:54:44 ·
889 阅读 ·
0 评论