UVa679：Dropping Balls

最新推荐文章于 2021-01-14 14:04:41 发布

转载最新推荐文章于 2021-01-14 14:04:41 发布 · 42 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/JayZhu/p/4264939.html

本文介绍了一个在完全二叉树结构中模拟球下落过程的问题。每个非终端节点都设置了一个初始为false的标志位，当球经过这些节点时会改变标志位的状态并据此决定进入左子树还是右子树。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

　　　　　　　　　　　　　　　　　　　　　　Dropping Balls

A number of K balls are dropped one by one from the root of a fully binary tree structure FBT. Each time the ball being dropped first visits a non-terminal node. It then keeps moving down, either follows the path of the left subtree, of follows the path of the right subtree, until it stops at one of the leaf nodes of FBT. To determine a ball's moving direction a flag is set up in every non-terminal node with two values, either false or true. Initially, all of the flags are false. When visiting a non-terminal node if the flag's current value at this node is false, then the ball will first switch this flag's value, i.e.,from the false to the true, and then follow the left subtree of this node to keep moving down. Otherwise, it will also switch this flag's value, i.e., from the true to the false, but will follow the right subtree of this node to keeping moving down. Further, all nodes of FBT are sequentially numbered, starting at 1 with nodes on depth 1, and then those on depth 2, and so on. Nodes on any depth are numbered from left to right.

For example, Fig. 1 represents a fully binary tree of maximum depth 4 with the node numbers 1, 2, 3, ..., 15. Since all of the flags are initially set to be false, the first

转载于:https://www.cnblogs.com/JayZhu/p/4264939.html