10-排序6 Sort with Swap(0, i) (25分)

10-排序6 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>
using namespace std;

int main(){
	int N, x, num=0, i, tmp=0;
	scanf("%d", &N);
	int a[N], b[N];
	for (int i = 0; i < N; i++) {
		scanf("%d", &a[i]);
		b[a[i]] = i;
		if (a[i] == 0) x = i;
	}
	while (1) {
		while (a[x] != x) {
			a[x] = x;
			a[b[x]] = 0;
			x = b[x];
			num++;
		}
		for (i = tmp + 1; i < N; i++){
			if (a[i] ^ i) break;
		}
		if (!(i ^ N)) break;
		else {
			a[0] = a[i];
			a[i] = 0;
			b[a[0]] = 0;
			x = i;
			tmp = i;
			num++;
		}
	}
	printf("%d", num);
}