浙大数据结构：10-排序6 Sort with Swap(0, i) (25 分)

10-排序6 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>
#define Maxsize 100000
int A[Maxsize];
using namespace std;

int CountLoop(int a[], int i,int N) {
	/*计算a[]的第i个元素的环*/
	int flag = 0;//环里面是否含有0
	int NextIndex, CurIndex;
	int count = 0;//count统计点的个数
	CurIndex = i;
	if (a[CurIndex] == CurIndex)return 0;
	while (a[CurIndex] != CurIndex) {
		if (a[CurIndex] == 0)flag = 1;
		NextIndex = a[CurIndex];
		a[CurIndex] = CurIndex;
		CurIndex = NextIndex;
		count++;
	}
	if (flag == 1)return count-1;
	if (flag == 0)return count+1;

}

int TimesOfSwap(int a[], int N) {
	int res = 0;
	for (int i = 0; i < N; i++) {
		res += CountLoop(a, i,N);
	}
	return res;
}

int main() {
	int N;
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}
	cout << TimesOfSwap(A, N);
	return 0;
}

测试结果