反转 (reverse)

题目链接: https://www.luogu.com.cn/problem/CF1638A

题目描述

You are given a permutation $p_1,p_2,\dots ,p_n$ of length $n$ . You have to choose two integers $l,r$ ($1\le l\le r\le n$) and reverse the subsegment $[l,r]$ of the permutation. The permutation will become $p_1,p_2,\dots ,p_{l-1},p_r,p_{r-1},\dots ,p_l,p_{r+1},p_{r+2},\dots ,p_n$ .

Find the lexicographically smallest permutation that can be obtained by performing exactly one reverse operation on the initial permutation.

Note that for two distinct permutations of equal length $a$ and