Category
Similar Problems
0765. Minimum method
Time limit : 1000 ms
Memory limit : 64 mb
The array is sorted with selection sort in ascending order. How many times does the first element in initial array change its position?
Input
The first line contains the number of elements in array n (1 ≤ n ≤ 1000). The second line contains the elements of array. It is known that all elements in array are different and not greater than 109 by absolute value.
Output
Print the number of movements of the first element.
Samples
№ |
Input |
Output |
1 |
3 1 3 2 |
0 |
2 |
2 2 1 |
1 |
3 |
4 4 1 5 3 |
3 |
Text from: e-olimp.com