1067 Sort with Swap(0, i) （PAT甲级）

1067. Sort with Swap(0,*) (25)-PAT甲级真题（贪心算法）_柳婼的博客-CSDN博客

先贴柳婼的做法，非常简洁，学习....

我繁琐的解法如下：

#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
const int MAXN = 100000;

int N, cnt, nbr;
std::vector<int> a;
int findLoc[MAXN];
std::set<int> st;

void doSwap(){
    int loc = findLoc[0];
    if(loc == 0){
        int i = findLoc[*st.begin()];
        findLoc[a[i]] = 0;
        findLoc[0] = i;
        std::swap(a[0], a[i]);
        cnt++;
    } else{
        int tmpLoc = findLoc[loc];
        findLoc[a[tmpLoc]] = loc;
        findLoc[0] = tmpLoc;
        st.erase(a[tmpLoc]);
        std::swap(a[loc], a[tmpLoc]);
        if(tmpLoc == 0){
            cnt -= 2;
        } else{
            cnt--;
        }
    }
}

int main(){
    scanf("%d", &N);
    a.resize(N);
    cnt = 0;
    for(int i = 0; i < N; ++i){
        scanf("%d", &a[i]);
        findLoc[a[i]] = i;
        if(i != a[i]){
            cnt++;
            if(a[i] != 0){
                st.insert(a[i]);
            }
        }
    }
    if(cnt == 0){
        printf("0");
        return 0;
    }
    nbr = 0;
    while(cnt != 0){
        doSwap();
        nbr++;
    }
    printf("%d", nbr);
    return 0;
}

题目如下：

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 (≤105) 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