1067 Sort with Swap(0, i) (25分)

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

---

参考：《算法笔记》

#include<iostream>
#include<algorithm>

using namespace std;

const int maxn = 100010;
int pos[maxn];	

int main(){
	int n, number;
	cin >> n;
	int left = n - 1;	//left为除0以外不在自己位置上的个数
	for(int i = 0; i < n; i++){
		cin >> number;
		pos[number] = i;	//存放数字所在的位置
		if(i == number && number != 0){
			left--;
		}
	}
	int ans = 0, k = 1;			//k为不在自己位置上的数
	while(left > 0){
		//0回到0位置上时，选取不在位置上的数进行交换
		if(pos[0] == 0){
			while(k < n){
				if(pos[k] != k){
					swap(pos[0], pos[k]);
					ans++;
					break;
				}
				k++;		
			}
		}
		//0不在0位置上时，将0所在位置的数的位置 与 0的位置交换
		while(pos[0] != 0){
			swap(pos[0], pos[pos[0]]);
			ans++;
			left--;
		}
	}
	cout << ans << endl;

    return 0;
}