给定正整数的数组A [1 ... N],您必须按以下方式按升序对其进行排序:在每个操作中,选择任意2个相等长度的非重叠子数组并交换它们.即,选择两个子阵列A [i ...(i + k-1)]和A [j ...(j + k-1)],使得i + k-1 <j并且交换A [i ]与A [j]的,A [1 + 1] A [J + 1] ...和A [1 + K-1]与A [J + K-1].
Example:
For N=6
6 7 8 1 2 3
Only one operation is needed as after swapping (6 7 8) and (1 2 3 ) sub arrays
we can get …