PTA 1067（另外做法）

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

---

这题其实跟贪心算法无关，是一个普通的连通分量题，dfs即可

#include<cstdio>
using namespace std;
int d[100010],a[100010];
void dfs(int x){
 d[x] = 0;x = a[x];
 if(!x)return;
 dfs(x);
}
int n,r,k,x;
int main(){
 scanf("%d",&n);
 for(int i=0;i<n;i++){
  scanf("%d",&a[i]);
  if(a[i] != i){
   d[i] = 1;k++;
  }
 }
 if(!d[0])k++;
 for(int i=0;i<n;i++)
 if(d[i]){
   if(!d[0]){
    a[0] = a[i];a[i] = 0;
    d[0] = 1;k++;
   }
   dfs(0);
  }
 printf("%d",k-1);
 return 0;
}

用时