1067 Sort with Swap(0, i)

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 (≤10^​5) 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

AC代码

#include <cstdio>
#include <iostream>
#include <algorithm> 
using namespace std;

int main(){ 
	int n, t, cnt = 0;
	int num[100001]; //每个数的位置 
	cin>>n;
	for(int i = 0; i < n; i++){
		cin>>t;
		num[t] = i;
	}
	for(int i = 1; i < n; i++){
		if(i != num[i]){
			while(num[0] != 0){ //0不在原位
				swap(num[0], num[num[0]]);
				cnt++; 
			}
			if(i != num[i]){
				swap(num[0], num[i]);
				cnt++;
			}
		}
	}
	cout<<cnt;
	return 0;
}