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.

笛卡尔树.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．