Bidirectional dfs: Codeforces Round # 498 (Div3)
Cartesian tree: after a given sequence, ask your maximum number of blocks may be separated so that the internal sort of each sequence and the result of the direct sort ordering the same maximum number of blocks is the number?