主席树
SpongeBob_Y
这个作者很懒,什么都没留下…
展开
-
HDU - 3887 Counting Offspring(DFS序+主席树)
题目链接 You are given a tree, it’s root is p, and the node is numbered from 1 to n. Now define f(i) as the number of nodes whose number is less than i in all the succeeding nodes of node i. Now we need ...原创 2019-06-06 15:41:28 · 221 阅读 · 8 评论 -
SPOJ - COT Count on a tree (主席树)
题目链接 You are given a tree withNnodes. The tree nodes are numbered from1toN. Each node has an integer weight. We will ask you to perform the following operation: u v k: ask for the kth minimum...原创 2019-05-29 20:16:48 · 202 阅读 · 0 评论