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 <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int pos[maxn];      //存放各数字当前所处的位置编号
int main()
{
    int n, ans = 0;
    scanf("%d", &n);
    int left = n - 1, num;  //left是除0外不在本位上数字的个数
    for(int i = 0; i < n; i++)
    {
        scanf("%d", &num);
        pos[num] = i;   //num所处的位置为i
        if(num == i && num != 0)    //如果还有不在本位上的数字
            left--;     //left减1
    }
    int k = 1;  //k存放除0意外当前不在本位上的最小的数
    while(left > 0)     //只要还有数不在本位上
    {
        if(pos[0] == 0)     //如果0在本位上，寻找一个不在本位上的数与0交换
        {
            while(k < n)
            {
                if(pos[k] != k)
                {
                    swap(pos[0], pos[k]);   //k与0交换位置
                    ans++;
                    break;      //退出循环
                }
                k++;
            }
        }

        while(pos[0] != 0)      //0不在本位
        {
            swap(pos[0], pos[pos[0]]);  //pos[0]和0交换  pos[0]是0所在的下标
            ans++;  //第一次pos[0]是7  pos[pos[0]]也就是pos[7]是2  也就是第2个位置跟第7个位置交换
            left--;
        }
    }
    printf("%d\n", ans);
    return 0;
}