CodeForces - 1153D. Serval and Rooted Tree（树状dp）

最新推荐文章于 2020-09-29 13:00:42 发布

池南生苍龙

最新推荐文章于 2020-09-29 13:00:42 发布

阅读量198

点赞数

文章标签：树形dp

本文链接：https://blog.csdn.net/weixin_43896680/article/details/89367371

版权

本文介绍了一道关于树形dp的题目，Serval需要在一颗有根树上分配数字，使得根节点的值最大化。题目中每个非叶节点的操作要么是取最大值，要么是最小值。通过计算每个节点的dp值，可以找到最佳的分配方案，从而求出根节点的最大可能值。文章提供了题意解释、示例解析以及题解思路。

摘要由CSDN通过智能技术生成

D. Serval and Rooted Tree

Now Serval is a junior high school student in Japari Middle School, and he is still thrilled on math as before.

As a talented boy in mathematics, he likes to play with numbers. This time, he wants to play with numbers on a rooted tree.

A tree is a connected graph without cycles. A rooted tree has a special vertex called the root. A parent of a node v is the last different from v vertex on the path from the root to the vertex v. Children of vertex v are all nodes for which v is the parent. A vertex is a leaf if it has no children.

The rooted tree Serval owns has n nodes, node 1 is the root. Serval will write some numbers into all nodes of the tree. However, there are some restrictions. Each of the nodes except leaves has an operation max or min written in it, indicating that the number in this node should be equal to the maximum or minimum of all the numbers in its sons, respectively.

Assume that there are k leaves in