|
|
back to boardShow all messages Hide all messagesCan somebody give me full explanation of this problem? Thanks. Full binary tree. Ilya is on the deep D, magis stone is on deep E. But what mean numbers Dp and Ep? You know the deepness of each by D and E, but this isn't enough to know, which exactly nodes are considered. So, in this problem the nodes are specified by 2 parameters: deepness, and a number of some leaf of it's subtree. Obviously, there can be many different pairs describing the same node. In this problem, only leafs are enumerated (see problem statement). Edited by author 26.10.2004 18:35 Edited by author 26.10.2004 19:32 Full Binary Tree with depth: F Stone is at depth: F-D from root and a tree rooted at the stone holds leaf #Dp Ilya is at depth: F-E from root and a tree rooted at the Ilya's position holds leaf #Ep find whether the distance of the two nodes is <= H |
|
|