Loading docs/ds/cartesian-tree.md +1 −1 Original line number Original line Diff line number Diff line Loading @@ -35,7 +35,7 @@ For i := 1 to n if k < top if k < top 当前元素.左儿子 := 栈顶元素 当前元素.左儿子 := 栈顶元素 当前元素入栈 当前元素入栈 top = k top := k ``` ``` ```cpp ```cpp Loading Loading
docs/ds/cartesian-tree.md +1 −1 Original line number Original line Diff line number Diff line Loading @@ -35,7 +35,7 @@ For i := 1 to n if k < top if k < top 当前元素.左儿子 := 栈顶元素 当前元素.左儿子 := 栈顶元素 当前元素入栈 当前元素入栈 top = k top := k ``` ``` ```cpp ```cpp Loading