pat a1067

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<stdio.h>
#include
using namespace std;
int main()
{
int n;
int sum=0;
int x;
int s[100000];
scanf("%d",&n);
int max=0;
int min=1;
for(int i=0;i<n;i++)
{
scanf("%d",&x);
s[x]=i;
if(x!=i&&x!=0)
max++;
}
while(max>0)
{
if(s[0]==0)
{
for(int k=min;k<n;k++)
{
if(s[k]!=k)
{
swap(s[0],s[k]);
sum++;
min=k;
break;
}
}
}
while(s[0]!=0)
{
swap(s[0],s[s[0]]);
max–;
sum++;
}
}
printf("%d",sum);
}