PAT-A- 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

---

只能使用0去交换，如果0在最前面且此时仍然不是有序序列，那么交换0与任意一个不在本位的数字 

#include <iostream>
#include <vector>
#include <algorithm>
#include <vector>
#define MAX 100000
using namespace std;
int data[MAX];
int main(){
	int n,temp;
	scanf("%d",&n);
	int left=n-1;
	for(int i=0;i<n;i++){
		scanf("%d",&temp);
		data[i]=temp;
		if(temp!=0&&temp==i){
			left--;
		}
	}
	int res=0,k=1;
	while(left){
		if(data[0]==0){
			while(data[k]==k){
				k++;
			}
			swap(data[0],data[k]);
		}
		else{
			swap(data[0],data[data[0]]);
			left--;
		}
		res++;
	}
	printf("%d",res);
	return 0;
}