水题
#include <iostream>
using namespace std;
int main ()
{
int n;
cin>>n;
while(n--)
{
int num;
cin>>num;
int a[num];
for(int i = 0; i < num; i++)
{
cin>>a[i];
//cout<<a[i];
}
int t, count = 0, flag = 1;
while(flag)
{
flag = 0;
for(int i = 0; i < num-1; i++)
{
if(a[i]>a[i+1]){t = a[i]; a[i] = a[i+1]; a[i+1] = t;flag = 1;count++;}
}
}
cout<<"Optimal train swapping takes "<<count<<" swaps."<<endl;
}
return 0;
}
又是一个一遍A掉的题目,没什么价值,更没什么收获。