Given any permutation of the numbers {0, 1, 2,..., N−1}, it is easy to sort them in increasing order. But what if Swap(0, *)
is the ONLY operation that is allowed to use? For example, to sort {4, 0, 2, 1, 3} we may apply the swap operations in the following way:
Swap(0, 1) => {4, 1, 2, 0, 3}
Swap(0, 3) => {4, 1, 2, 3, 0}
Swap(0, 4) => {0, 1, 2, 3, 4}
Now you are asked to find the minimum number of swaps need to sort the given permutation of the first N nonnegative integers.
Input Specification:
Each input file contains one test case, which gives a positive N (≤105) followed by a permutation sequence of {0, 1, ..., N−1}. All the numbers in a line are separated by a space.
Output Specification:
For each case, simply print in a line the minimum number of swaps need to sort the given permutation.
Sample Input:
10
3 5 7 2 6 4 9 0 8 1
Sample Output:
9
/**
算法思想:
1.用0所在位置的值找到对应位置并与其交换.
2.当0的位置是0时,找到一个不在本身位置的数与零交换
3.重复上述过程,直到所有数全部归位
**/
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[200];
int main()
{
int n;
scanf("%d",&n);
for(int i=0; i<n;i++)
scanf("%d",&a[i]);
int num=0;
for(int i=0; i<n; i++)
{
while(a[0]!=0)
{
swap(a[0],a[a[0]]);
num++;
}
if(a[i]!=i)
{
swap(a[0],a[i]);
num++;
}
}
printf("%d\n",num);
return 0;
}