UVA299

题意：求交换的次数

思路：冒泡，每换一次+1，水题。。。。

#include<stdio.h>
#include<string.h>

int arr[55];

int main(){
	int a, n, m, temp;
	scanf("%d", &a);
	while (a--){
		scanf("%d", &n);	
		memset(arr, 0, sizeof(arr));			
		m = 0;
		for (int i = 0; i < n; i++)
			scanf("%d", &arr[i]);
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n - i - 1; j++)
				if (arr[j] > arr[j + 1]){
					temp = arr[j];	
					arr[j] = arr[j + 1];
					arr[j + 1] = temp;
					m++;
				}
		printf("Optimal train swapping takes %d swaps.\n", m);	
	}
	return 0;
}