Inversion Sorting

CSESInteractive ProblemsOpen on judge ↗

There is a hidden permutation a_1, a_2,\dots, a_n of integers 1, 2,\dots, n. Your task is to sort the permutation by reversing subarrays. On each turn, you can reverse a subarray of the permutation. After that, you will be reported the number of inversions in the permutation. If the number of inversions is 0 (i.e., the permutation is sorted), you win. Interaction This is an interactive problem.

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI