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 (≤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.

解析

给出一个无序数组，按照始终将0与其他数换，计算最少多少步变为有序序列。

代码

#include<bits/stdc++.h>

#define INF 1<<29

using namespace std;

void pat1067() {
    int n, temp[100005];
    int res = 0;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int num;
        cin >> num;
        temp[num] = i; // 注意temp内容的放置位置
    }
    int begin = 1;	// 获取当前最小不用排序的位置
    while (true) {
        if (temp[0] == 0) {
            bool flag = false;
            for (int i = begin; i < n; ++i) {
                if (temp[i] != i) {
                    swap(temp[0], temp[i]);
                    res++;
                    flag = true;
                    begin = i;
                    break;
                }
            }
            if (!flag)
                break;
        } else {
            swap(temp[temp[0]], temp[0]);
            res++;
        }
    }
    cout << res << endl;
}


int main() {
    pat1067();
    return 0;
}