随笔分类 - 数据结构 树链剖分
摘要:This world need more Zhu 题目连接: http://acm.hdu.edu.cn/showproblem.php?pid=5840 Description As we all know, Zhu is the most powerful man. He has the inf
阅读全文
摘要:4448: [Scoi2015]情报传递 题目连接: http://www.lydsy.com/JudgeOnline/problem.php?id=4448 Description 奈特公司是一个巨大的情报公司,它有着庞大的情报网络。情报网络中共有n名情报员。每名情报员口J 能有 若T名(可能没有
阅读全文
摘要:Relief grainTime Limit: 20 SecMemory Limit: 256 MB题目连接http://acm.hdu.edu.cn/showproblem.php?pid=5029DescriptionThe soil is cracking up because of the ...
阅读全文
摘要:D. Happy Tree PartyTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/593/problem/DDescriptionBogdan has a birthday today and mom...
阅读全文
摘要:Do use segment treeTime Limit: 1 Sec Memory Limit: 256 MB题目连接http://www.bnuoj.com/v3/problem_show.php?pid=39566DescriptionGiven a tree withn(1 ≤ n ≤ 2...
阅读全文
摘要:2588: Spoj 10628. Count on a treeTime Limit: 1 Sec Memory Limit: 256 MB题目连接http://www.lydsy.com/JudgeOnline/problem.php?id=2588Description给定一棵N个节点的树,每...
阅读全文
摘要:A -Query on a treeTime Limit: 20 SecMemory Limit: 256 MB题目连接http://acm.hust.edu.cn/vjudge/contest/view.action?cid=87378#problem/ADescriptionYou are gi...
阅读全文
摘要:1.【bzoj4034】[HAOI2015]T2有一棵点数为 N 的树,以点 1 为根,且树点有边权。然后有 M 个操作,分为三种:操作 1 :把某个节点 x 的点权增加 a 。操作 2 :把某个节点 x 为根的子树中所有点的点权都增加 a 。操作 3 :询问某个节点 x 到根的路径中所有点的点权和...
阅读全文
摘要:Aragorn's StoryTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codevs.cn/problem/1060/DescriptionOur protagonist is the handsome human prince Aragorn...
阅读全文
摘要:2243: [SDOI2011]染色Time Limit: 20 SecMemory Limit: 256 MB题目连接http://www.lydsy.com/JudgeOnline/problem.php?id=2243Description给定一棵有n个节点的无根树和m个操作,操作有2类:1、...
阅读全文
摘要:1036: [ZJOI2008]树的统计CountTime Limit: 10 SecMemory Limit: 162 MBSubmit: 6769Solved: 2772[Submit][Status][Discuss]Description一棵树上有n个节点,编号分别为1到n,每个节点都有一个...
阅读全文