N - Apple Tree（DFS序1）

最新推荐文章于 2023-10-01 21:10:00 发布

Lyang0.0

最新推荐文章于 2023-10-01 21:10:00 发布

阅读量229

点赞数

分类专栏：暑假集训树状数组 dfs序文章标签：树状数组 dfs序暑假集训

本文链接：https://blog.csdn.net/qq_43588832/article/details/98984863

版权

这篇博客介绍了如何解决一棵满苹果树的子树苹果数量查询问题，使用了DFS序和树状数组的方法。初始每个树杈都有苹果，接着处理一系列的苹果增减与查询操作。通过DFS序实现区间化，利用树状数组进行单点修改和区间查询，以高效地回答每个查询。

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

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 forks by 1 to N and the root is always numbered by 1. Apples will grow on the forks and two apple won't grow on the same fork. kaka wants to know how many apples are there in a sub-tree, for his study of the produce ability of the apple tree.

The trouble is that a new apple may grow on an empty fork some time and kaka may pick an apple from the tree for his dessert. Can you help kaka?