构造数组的最大MaxTree 时间复杂度O(N) 额外空间复杂度O(N)(* establish the tree with the following principles: * 1. the father of each number is the first larger number on its left and the smaller one on its right, the first one larger than it * 2. if a number is infin