Optimal Sorting

*An optimist believes in the optimal usage of all options available.* Chef gives you a sequence $A_1, A_2, \ldots, A_N$ consisting of integers. You can perform the following operation on the sequence any number of times (possibly $0$): - Select any continuous segment $A_{l \ldots r}$ and sort the segment in **non-descending** order, while keeping other elements unchanged. The cost to perform this