Code-Dreamer的博客

Aragorn's Story Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11303    Accepted Submission(s): 2948 Problem Description Our prot

传送门：scu4559 Description There is a king who is very rich, but he is very stingy. In his kingdom, there are many cities. He built many highways to connect all the cities. Buecause of his mean

题目链接：  PowerOj1179  1179: 我要10个G Time Limit: 8500 MS Memory Limit: 2097152 KB Total Submit: 7 Accepted: 5 Page View: 21 Submit Status Discuss Description      大黄对于以太网的速

传送门：CDOJ1590 题目大意： 给你一颗n个节点的树，根为T，初始时所有节点的值为0，然后给你m次操作，三种操作 1，更新一个子树，节点a的子树节点都加上b 2，更新一条树链，将从u-v的所有节点都加上c 3，查询节点的值 题目思路： 这题更新子树很容易想到dfs序，更新树链很容易想到树链剖分，但是如果我们理解树链剖分 的话就知道树链剖