UVa 299 - Train Swapping

299 - Train Swapping

 * http://acm.uva.es/p/v2/299.html

Summary
This problem amounts to counting the number of inversions in the dataset. $$L \leq 50$$, so we can do this trivially using an $$O(N^2)$$ algorithm, such as bubble sort or insertion sort.

Explanation
Counting the number of inversions simply counts the number of swaps it takes in sorting, which is straightforward for bubble sort - increment a counter everytime you swap two adjacent items.

Optimizations
This can also be done with $$O(N \log N)$$ sorting algorithms, but they are overkill as $$L \leq 50$$

Input
3 3 1 3 2 4 4 3 2 1 2 2 1

Output
Optimal train swapping takes 1 swaps. Optimal train swapping takes 6 swaps. Optimal train swapping takes 1 swaps.