CustomCC0-1.0#cptp0181500
Tournament Swap Sorting
Summary
- •Phase 4 / greedy, inversions
- •Reasoning-first competitive programming drill
Problem Description
Given a permutation of n players, you can perform the following operation any number of times: Swap any two adjacent players if the left one is strictly less than the right one. What is the minimal number of operations needed to sort the permutation in increasing order?
How to read this problem in plain language:
- This is a Phase 4 reasoning drill focused on greedy, inversions.
- Typical lenses to test first: greedy, permutation, sorting.
- Constraints reminder: 1 ≤
Mini examples for mental simulation:
1) Boundary example: Describe why this case is tricky. Explain expected behavior and why naive logic may fail.
2) Adversarial example: Adversarial case where naive greedy/local decision looks correct but fails globally.
Lite-mode writing target:
- Write 1~2 observations that shrink the search space.
- Name one final algorithm and state target complexity explicitly.
- Validate with at least 2 edge cases and one hand simulation.
Constraints
- •1 ≤
Analysis
Key Insight
The goal is to force explicit intermediate reasoning before revealing more.
greedypermutationsorting