树链剖分
圣诞老人家
这个作者很懒,什么都没留下…
展开
-
hdu 3966 树链剖分
Our protagonist is the handsome human prince Aragorn comes from The Lord of the Rings. One day Aragorn finds a lot of enemies who want to invade his kingdom. As Aragorn knows, the enemy has N camps ou原创 2017-09-04 18:18:56 · 161 阅读 · 0 评论 -
树链剖分详解
树链剖分用一句话概括就是:把一棵树剖分为若干条链,然后利用数据结构(树状数组,SBT,Splay,线段树等等)去维护每一 条链,复杂度为O(logn) 那么,树链剖分的第一步当然是对树进行轻重边的划分。 定义size(x)为以x为根的子树节点个数,令v为u的儿子中size值最大的节点,那么(u,v)就是重边,其余边为轻边。 当然,关于这个它有两转载 2017-08-28 11:58:46 · 230 阅读 · 0 评论 -
hdu 6162 树链剖分
Problem Description Mr. Cui is working off-campus and he misses his girl friend very much. After a whole night tossing and turning, he decides to get to his girl friend's city and of course, with w原创 2017-08-28 12:42:07 · 252 阅读 · 0 评论