A 1067 Sort swap(0)

最新推荐文章于 2022-09-15 10:30:41 发布

weixin_39742952

最新推荐文章于 2022-09-15 10:30:41 发布

阅读量123

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/weixin_39742952/article/details/88419117

版权

算法专栏收录该内容

10 篇文章 0 订阅

订阅专栏

1067 Sort with Swap(0, i) （25 分）
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

注意 while (a[0] != 0)
{
swap(a[0], a[a[0]]);
cnt ++;
cout <<i << endl;
for (int j = 0; j < n; ++j)
cout << a[j] << ends;
cout << endl;
}
不仅仅是寻找0，更是将a[i]移动到i的位置上

#include <bits/stdc++.h>

using namespace std;
 
int main()
{
    int n;
    cin >> n;
    int a[n+10];
    for (int i = 0; i < n; ++i)
    {
        int temp;
        cin >> temp;
        a[i] = temp;
    }
    int cnt = 0;
    for (int i = 0; i < n; ++i)
    {
        if (a[i] != i)
        {
            swap(a[i], a[0]);
            cout << i << endl;
            for (int j = 0; j < n; ++j)
                    cout << a[j] << ends;
                cout << endl;
            if (i != 0)
                cnt++;
            while (a[0] != 0)
            {
                swap(a[0], a[a[0]]);
                cnt ++;
                cout <<i <<  endl;
                for (int j = 0; j < n; ++j)
                    cout << a[j] << ends;
                cout << endl;
            } 
            
        }
    }
    cout << cnt << endl;
    system("pause");
    return 0;
}