dsu_on_tree
Coco_T_
东南大学本科毕业生,浙江大学在读研究生
展开
-
codeforces600E. Lomsat gelral(dsu on tree)
You are given a rooted tree with root in vertex 1. Each vertex is coloured in some colour. Let’s call colour c dominating in the subtree of vertex v if there are no other colours that appear in the su原创 2017-08-24 21:38:35 · 393 阅读 · 0 评论 -
cf570D. Tree Requests(dsu on tree)
Roman planted a tree consisting of n vertices. Each vertex contains a lowercase English letter. Vertex 1 is the root of the tree, each of the n - 1 remaining vertices has a parent in the tree. Vertex i原创 2017-08-25 11:01:36 · 296 阅读 · 0 评论 -
[trick]dsu on tree
原网址(鸣谢Yveh) UPD 17.3.27:这个技巧实际上局限性也很明显。第一只能支持子树查询,第二不支持修改操作。 概述 写这篇文章的原因是NOIP前刷Codeforces做到一道题,用这种方式,以很低的代码复杂度做到的优秀时间复杂度。 于是我学习了一下CF上这篇文章,翻译过来安利一下,也算作是自己的学习笔记吧。 什么是dsu on tree d...转载 2017-10-18 21:25:57 · 569 阅读 · 0 评论