Codeforces 1076E - Vasya and a Tree - 树状数组题解链接https://lucien.ink题目链接http://codeforces.com/contest/1076/problem/E题意给你一棵有根树，有 $m$ 次操作，每次操作为 v d x，代表着把以 $v$ 为根深度不超过 $d$ 的所有点的权值都加上 $x$，问所有操作都进行完之后，每个点的...
题目链接http://acm.hdu.edu.cn/showproblem.php?pid=6393题目Problem DescriptionChika is elected mayor of Numazu. She needs to manage the traffic in this city. To manage the traffic is too hard for her. So ...