Description: There is a special kind of binary tree is called Cartesian tree, this tree each node has two key code, recorded as key1 and key2. Now give you a key code, key code for each group with two integers that satisfy the requirements of a structural nature of the following two Cartesian tree: only the Cartesian tree of the first key code tree, which is a binary tree sort. Cartesian tree trees only consider the second key code, and they meet the minimum heap similar nature, that is, the father of any of the key node of the second sub-code than it is the second node key code small.
File list (Check if you may need any files):
笛卡尔树.txt
Download