codeforce 1059E Split the Tree

题目http://codeforces.com/problemset/problem/1059/E

参考http://www.cnblogs.com/waldenlake/p/9750249.html

我也想到了贪心，从一个子叶a出发向上每一个都标记直至不满足条件，但其实一个点是可以被重复标记的visit是可以被覆盖的，总是下意识！visit，如果另一个子叶b向上爬得更远的话，经过a和b的父亲之后还能继续向地上爬，这总是能满足最优解。

原文地址：https://www.cnblogs.com/LandingGuy/p/9780221.html

时间： 2024-11-08 21:25:01

codeforce 1059E Split the Tree的相关文章

Codeforces 1059E. Split the Tree

题目:http://codeforces.com/problemset/problem/1059/E 用倍增可以在nlog内求出每个节点占用一个sequence 时最远可以向父节点延伸到的节点,对每个节点作为sequence 的最后一个元素向上延伸时,将节点的父节点属性合并(类似于并查集的操作), 存在优先队列里保证每次先操作dep最大的节点 #include<iostream> #include<cstdio> #include<cmath> #include<

Split The Tree

Split The Tree 时间限制: 1 Sec 内存限制: 128 MB 题目描述 You are given a tree with n vertices, numbered from 1 to n. ith vertex has a value wiWe define the weight of a tree as the number of different vertex value in the tree.If we delete one edge in the tree, t

CF 1039D You Are Given a Tree && CF1059E Split the Tree 的贪心解法

1039D 题意: 给你一棵树,要求对给定链长于 k = 1, 2, 3, ..., n,求出最大的链剖分. 1059E 题意: 给你一棵带权树,要求对于一组给定的 L, W 求出最小完全竖链剖分满足每条链点数不超过 L,权值和不超过 W. 显然两题是有共同点的,就是让我们求满足一定条件的树的最值链剖分. 比较暴力的可以尝试用 DP 计数,但是我不想深入 DP,因为方程比较复杂,思考起来不太容易. 很巧的是,这两题可以用相似的贪心思想来做. 在思考具体细节之前,需要明确贪心的主要思想:在从下往上

Solution: 题解 CF1059E Split the Tree

给出一个堆贪心解法记点\(u\)的深度为\(d_u(d_1=0)\),父亲为\(f_u\),拥有儿子数量\(es_u\). 首先找到每个点的最远延伸点(点\(u\)的最远延伸点记为\(v_u\)),借助树上倍增即可. 接下来是贪心方法在每次链连接完后删掉这些点,那么每条链的尾端一定是一个叶子. 那么就想办法找出目前贪心最优的叶子,然后往上连接. 以下的贪心本蒟蒻并没有想出严格证明方法,只能感性理解一下了QAQ. 贪心 1:目前\(d_{v_u}\)最小的叶子\(u\)是最优叶子举个栗子:\

CF461B Appleman and Tree （树DP）

CF462D Codeforces Round #263 (Div. 2) D Codeforces Round #263 (Div. 1) B B. Appleman and Tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Appleman has a tree with n vertices. Some of t

[leetcode-663-Equal Tree Partition]

Given a binary tree with n nodes, your task is to check if it's possible to partition the tree to two trees which have the equal sum of values after removing exactly one edge on the original tree. Example 1: Input: 5 / 10 10 / 2 3 Output: True Explan

CF 461B Appleman and Tree 树形DP

Appleman has a tree with n vertices. Some of the vertices (at least one) are colored black and other vertices are colored white. Consider a set consisting of k (0 ≤ k < n) edges of Appleman's tree. If Appleman deletes these edges from the tree, then

Codeforces 461 B. Appleman and Tree

树形DP... B. Appleman and Tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Appleman has a tree with n vertices. Some of the vertices (at least one) are colored black and other vertices a

Codeforces Round #263 (Div. 2) D. Appleman and Tree（树形DP）

题目链接 D. Appleman and Tree time limit per test :2 seconds memory limit per test: 256 megabytes input :standard input output:standard output Appleman has a tree with n vertices. Some of the vertices (at least one) are colored black and other vertices a