ACM--Sorting by Swapping

Sorting by Swapping

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB
Total submit users: 1514, Accepted users: 1381
Problem 10067 : No special judgement

Problem description

Given a permutation of numbers from 1 to n, we can always get the sequence 1, 2, 3, …, n by swapping pairs of numbers. For example, if the initial sequence is 2, 3, 5, 4, 1, we can sort them in the following way:

2 3 5 4 1
1 3 5 4 2
1 3 2 4 5
1 2 3 4 5

Here three swaps have been used. The problem is, given a specific permutation, how many swaps we needs to take at least.

Input

The first line contains a single integer t (1 <= t <= 20) that indicates the number of test cases. Then follow the t cases. Each case contains two lines. The first line contains the integer n (1 <= n <= 10000), and the second line gives the initial permutation.

Output

For each test case, the output will be only one integer, which is the least number of swaps needed to get the sequence 1, 2, 3, …, n from the initial permutation.

Sample Input

2
3
1 2 3
5
2 3 5 4 1

Sample Output

0
3

分析

要调换次数最好，那么尽量的每次调换的效率最高，因此先判断该数字是否应该在此位置，如果不在，将此数字调换到应该到的位置去，这样每一次交换都是有效交换（至少有一个数字到了自己应该到的位置）。
因此，这样的交换产生的交换次数最少，从而符合题意。

神奇的代码：

#include <iostream>
#include <algorithm>
using namespace std;
int a[10001]= {0};

int main() { 
int t;
	cin>>t;
	while(t--) {
		int sum=0;
		int n;
		cin>>n;
		for(int i=0; i<n; i++)
			cin>>a[i];
		for(int i=0; i<n; i++) {
			while(a[i]!=i+1) {//如果不应该在此位置
				swap(a[i],a[a[i]-1]);//将此数字调换到应该到的位置去，每一次交换都是有效交换，因此，这样的交换产生的交换次数最少，从而符合题意
				sum++;
			}
		}
		cout<<sum<<endl; 
	}
	return 0;
}