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 (≤105) 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 <vector>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <string>
#include <sstream>
using namespace std;
int num[1000000];
int pos[1000000];
int main()
{
int n;
cin>>n;
int f=0;
int t=0;
int wn=0;
for(int i=0; i<n; i++)
{
cin>>num[i];
pos[num[i]]=i;
if(num[i]!=i)
wn++;
}
int k=1;
while(1)
{
//cout<<"wn "<<wn<<endl;
if(pos[0]==0)
{
wn--;
if(wn<=0)
break;
for(int i=k;i<n;i++)
{
if(pos[i]!=i)
{
k=i;
swap(pos[0],pos[i]);
wn++;
break;
}
}
t++;
}
else
{
swap(pos[0],pos[pos[0]]);
wn--;
t++;
}
}
cout<<t;
return 0;
}