uva--299

水题一道，冒泡思想

//#define LOCAL#include <stdio.h>#include <string.h>#define MAXN 50 + 10int carrage[MAXN];int find(int i, int l);int main(){#ifdef LOCALfreopen("input.txt", "r", stdin);//freopen("output.txt", "w", stdout);#endifint n;int l;int i, j;int result;while(scanf("%d", &n) == 1){while(n--){// 数据初始化result = 0;  memset(carrage, 0, sizeof(carrage));// 数据输入 scanf("%d", &l);for(i = 1; i <= l; i++){scanf("%d", &carrage[i]);}// 算法主体for(i = 1; i <= l; i++){int p = find(i, l);// 从最小的元素开始循环 for(j = 1; j <= p; j++){if(carrage[j] > i){result++;}} }  printf("Optimal train swapping takes %d swaps.\n", result);}}return 0;}int find(int i, int l){int j;for(j = 1; j <= l; j++){if(carrage[j] == i)return j;}return -1;}