分析:模拟冒泡排序的过程即可。
#include <cstdio>
int main()
{
int carriage[55];
int T;
scanf("%d",&T);
while (T--)
{
int n,ans=0;
scanf("%d",&n);
for (int i=0;i<n;i++)
scanf("%d",&carriage[i]);
for (int i=n-2;i>=0;i--)
for (int j=0;j<=i;j++)
if (carriage[j]>carriage[j+1])
{
ans++;
int t=carriage[j];
carriage[j]=carriage[j+1];
carriage[j+1]=t;
}
printf("Optimal train swapping takes %d swaps.\n",ans);
}
return 0;
}