pat-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

 

这题还是有难度的呀，值得研究研究 

 

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
int a[100005];
int main()
{
    cin.sync_with_stdio(false);
    int n,x;
    cin>>n;
    int left = n - 1;//除0以外，不在本位上的数的个数，默认都不在本位上
    for(int i = 0 ; i < n ; i++)
    {
        cin>>x;
        a[x] = i;//a[x]记录输入的这个数的位置
        if(x == i && x != 0)//如果这个数不为零且他在他应该在的位置上
        {
            left --;
        }
    }
    int k = 1;//存放当前不在本位上的最小的数
    int cnt = 0;//交换次数
    while(left > 0)//只要还有数字不在本位上
    {
        if(a[0] == 0)
        {
            while(a[k] != k)
            {
                swap(a[0],a[k]);
                cnt ++;
                break;
            }
             k++;
        }
        while(a[0] != 0)
        {
            swap(a[0],a[a[0]]);
            cnt ++;
            left --;
        }
       
    }
    cout<<cnt<<endl;
    return 0;
}