Скачать или смотреть [Codeforces] 144A - Arrival of the General | Rated 800 | C++ Solution & Explanation

In this video, I walk through the solution to the Codeforces problem “144A – Arrival of the General”, explaining the intuition and implementation step by step using C++.

We break down the problem, identify the tallest and shortest soldiers in the lineup, and calculate the minimum number of swaps needed to move them to their correct positions. This problem is a great example of careful index tracking and understanding how swaps affect positions.

I’m still learning and improving, so if you know a cleaner implementation, a more intuitive way to reason about the swaps, or have tips for solving similar problems, I’d love to hear your feedback in the comments!

📌 Language Used: C++
📌 Difficulty: Beginner
📌 Topic: Arrays / Implementation

If this video helped you, consider liking, commenting, and subscribing for more Codeforces walkthroughs and competitive programming content 🎖️🚀