PAT 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 (≤) 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<vector>
using namespace std;
int main(){
  int n, i, cnt=0, sp=0;
  vector<int> v(100000), idx(100000);
  scanf("%d", &n);
  for(i=0; i<n; i++){
    scanf("%d", &v[i]);
    idx[v[i]] = i;
    if(i==idx[i]) cnt++;
  }
  int begin=0;
  while(cnt<n){
    if(idx[0]!=0){
      swap(v[idx[0]], v[idx[idx[0]]]);
      swap(idx[0], idx[idx[0]]);
      cnt++;
    }else{
      while(v[begin]==begin) begin++;
      swap(idx[0], idx[v[begin]]); // 先交换序号再交换值
      swap(v[0], v[begin]);
    }
      sp++;
  }
  cout<<sp<<endl;;
  return 0;
}