Ah I did not expect on the test.
Direct-half of the answer, then $ nlogn $ solving the longest rise to $ check $ sequence is greater than $ K $ can be.
Nausea is then required output program, and. . . Dictionary minimum order.
We consider solutions obtained after the separation of two answers.
$ LIS $ process is actually similar to the achievements, we want the current decision tree to hang at the current point of a certain depth, the smallest lexicographical program below.
So when we compare two scenarios when you ask them out of their $ LCA $ in $ LIS $ trees, then in exactly the same part of more than $ $ LCA, so they only need to compare what the $ LCA $ section minimum size, more preferably smaller, while running the LIS $ $ $ multiplication ran to the LCA $.
Complexity $ (nlognlog88400 + nlog ^ 2n) O $