1067 Sort with Swap(0, i) (25 分)

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<bits/stdc++.h>
using namespace std;
 
const int maxn = 100010;
 
int n;
int pos[maxn];

int main(){
    cin >> n;
    
    int a;
    int left=n-1,ans=0;
    
    for(int i=0;i<n;i++){
        cin >> a;
        pos[a] = i;
        
        if(i==a && a!=0)//a!=0别忘
            left--;
    }
    
    int k = 1;
    
    while(left > 0){
        if(pos[0] == 0){ //0在开始位置上面 
            while(k < n){ // 如果k每次从1开始会超时 
                if(pos[k] != k){
                    swap(pos[0],pos[k]);
                        ans++;
                    break;
                }
                k++;
            } 
        }else{
            swap(pos[0],pos[pos[0]]); // 交换0所在位置，和0所在位置的下标的所在位置 
            left--;
            ans++;
        }        
    }
    cout << ans << endl;
    
    return 0;
}