/*
* 解题思路:
* Bubble sort 的一道水题
*/
#include <stdio.h> int main( ) { int t,n; int i,j; int train[ 60 ]; int sum,tmp; scanf("%d",&t); while( t-- ) { scanf("%d",&n); for( i=0;i<n;i++ ) scanf("%d",&train[ i ]); sum = 0; for(i=0;i<n;i++ ) for( j=0;j<n-1;j++ ) if( train[ j ] > train[ j+1 ] ) { tmp = train[ j ]; train[ j ] = train[ j+1 ]; train[ j+1 ] = tmp; sum++; } printf("Optimal train swapping takes %d swaps.\n",sum); } return 0; }