原文:
Sorting by Swapping
描述:
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.
输入:
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.
输出:
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.
样例输入:
2 3 1 2 3 5 2 3 5 4 1
样例输出:
0 3
参考译文:
交换排序
描述:
给定从1到n的n个数字的数列,我们需要得到的是这n个数字的升序排列,经过一系列的交换操作,操作如下:
2 3 5 4 1
1 3 5 4 2
1 3 2 4 5
1 2 3 4 5
上述为三步交换操作,现在你要解决的问题是,给定一个n个整数的任意序列,找到得到上述序列的最小操作数。
输入:
测试数据包含多组,第一行包含一个整数T,用于表示测试的组数。
每组测试包含两行,第一行为一个整数n,接下来一行为n个整数的序列,每两个数之间用一个空格间隔。
输出:
每组测试对应一行输出,输出包含一个整数,用来表示最小操作数。
样例输入:
2 3 1 2 3 5 2 3 5 4 1
样例输出:
0 3
参考代码:
#include<iostream>
using namespace std;
int main()
{
int T;
cin >> T;
for(int t = 0;t < T;++t){
int n;
cin >> n;
int number[n+10];
for(int i = 1;i <= n;++i){
cin >> number[i];
}
int cnt = 1;
int swap = 0;
int num = 0;
while(cnt <= n){
if(number[cnt] == cnt){
++cnt;
}
else{
swap = number[cnt];
number[cnt] = number[swap];
number[swap] = swap;
++num;
}
}
cout << num << endl;
}
return 0;
}