题目:
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.
输入格式
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.
输出格式
For each case, simply print in a line the minimum number of swaps need to sort the given permutation.
输入样例
10
3 5 7 2 6 4 9 0 8 1
输出样例
9
算法
问题分析
- 利用表排序中数环的方法
- 包含0元素的环中需要交换n-1次
- 不包含0元素的环中需要交换n+1次
- 独立元素成环时,不需要交换
代码实现
int main()
{
int N;
scanf("%d",&N);
int* A=(int*)malloc(sizeof(int)*N);
int* T=(int*)malloc(sizeof(int)*N);
int i;
for(i=0;i<N;i++){
scanf("%d",&(A[i]));
T[A[i]]=i;
}
int count=0;
for(i=0;i<N;i++){
if(A[i]!=i){
count+=Cycle(A,T,N,i);
}
}
if(count==0||T[0]==0){
printf("%d",count);
}else{
printf("%d",count-2);
}
return 0;
}
Cycle函数:记录每个环中元素个数
int Cycle(int A[],int T[],int N,int t)
{
int count=0;
int p=t;
while(A[p]!=p){
A[p]=p;
p=T[p];
count++;
}
return count+1;
}