ACM_树链剖分
Coder_YX
ACMer
展开
-
HDU3966-树链剖分(区间更新,点查询)
Aragorn's StoryTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11303 Accepted Submission(s): 2948Problem DescriptionOur prot原创 2017-04-14 11:43:11 · 476 阅读 · 0 评论 -
SCUOJ4549-树链剖分(区间查询,区间更新,边权)
传送门:scu4559Description 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原创 2017-04-14 11:51:39 · 884 阅读 · 0 评论 -
PowerOJ1179-树链剖分
题目链接: PowerOj1179 1179: 我要10个GTime Limit: 8500 MS Memory Limit: 2097152 KBTotal Submit: 7 Accepted: 5 Page View: 21Submit Status DiscussDescription 大黄对于以太网的速原创 2017-04-25 23:31:25 · 401 阅读 · 0 评论 -
CDOJ1590-dfs+树链剖分(2017 UESTC Training for Data Structures O)
传送门:CDOJ1590题目大意:给你一颗n个节点的树,根为T,初始时所有节点的值为0,然后给你m次操作,三种操作1,更新一个子树,节点a的子树节点都加上b2,更新一条树链,将从u-v的所有节点都加上c3,查询节点的值题目思路:这题更新子树很容易想到dfs序,更新树链很容易想到树链剖分,但是如果我们理解树链剖分的话就知道树链剖原创 2017-07-03 19:36:37 · 543 阅读 · 0 评论