dfs序
文章平均质量分 80
tomjobs
别慌,慌也没用
展开
-
Codeforces-1467 E. Distinctive Roots in a Tree(dfs序,树上差分)
You are given a tree with ???? vertices. Each vertex ???? has a value ???????? associated with it.Let us root the tree at some vertex ????. The vertex ???? is called a distinctive root if the following holds: in all paths that start at ???? and end at som原创 2021-01-12 21:51:50 · 328 阅读 · 0 评论 -
Codeforces383 C. Propagating tree(dfs序线段树)
Iahub likes trees very much. Recently he discovered an interesting tree named propagating tree. The tree consists of n nodes numbered from 1 to n, each node i having an initial value ai. The root of the tree is node 1.This tree has a special property: whe原创 2020-09-24 21:54:30 · 422 阅读 · 1 评论 -
C. Cover the Tree2020 (dfs序构造) 牛客暑期多校训练营(第二场)
。题意:求最少的链覆盖所有边思路:可以想到任意链都得叶子开始叶子结尾,那么数目肯定是确定的,为叶子数目加一除以二。可以想到,为了尽可能的覆盖更多变,我们要选宽度尽可能大的叶子相连。这里的宽度我们可以用dfs序表示,选择非叶子节点作为根然后求dfs序,然后两两配对。但不能是最右边的叶子匹配最左边的叶子,比如 1->2,1->3, 1->4 , 4->5, 4->6中,1->4边就可能覆盖不到。所以要 a[i]匹配a[i+len/2]。#include &l原创 2020-07-14 09:30:26 · 204 阅读 · 0 评论 -
Apple Tree POJ - 3321(dfs序树状数组)
There is an apple tree outside of kaka’s house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.The tree has N forks which are connected by branches. Kaka numbers the f原创 2020-06-19 21:59:34 · 382 阅读 · 0 评论 -
AcWing 286. 选课(有依赖的树形dp / dfs序优化)
学校实行学分制。每门的必修课都有固定的学分,同时还必须获得相应的选修课程学分。学校开设了 N 门的选修课程,每个学生可选课程的数量 M 是给定的。学生选修了这 M 门课并考核通过就能获得相应的学分。在选修课程中,有些课程可以直接选修,有些课程需要一定的基础知识,必须在选了其他的一些课程的基础上才能选修。例如《Windows程序设计》必须在选修了《Windows操作基础》之后才能选修。我...原创 2019-09-06 17:02:09 · 500 阅读 · 1 评论 -
Rainbow Roads Gym - 101615D(dfs序,差分)
Rainbow RoadsYou are given a tree with n nodes (conveniently numbered from 1 to n). Each edge in this tree has one of n colors. A path in this tree is called a rainbow if all adjacent edges in the pa...原创 2019-10-02 23:13:58 · 301 阅读 · 0 评论