UVA 299-Train Swapping

贴上一水题：

#include <iostream>#include <cstring>using namespace std;int main(){int a[100];int n,m;int i, k;int ok=0;int count=0;cin>>n;while(n--){cin>>m;k=m;count=0;memset(a,0,sizeof(a));for(i=1; i<=m; i++){cin>>a[i];}while(k>1){ok=0;for(i=1; i<k; i++){if(a[i]==k){count+=(k-i);ok=1;}if(ok){a[i]=a[i+1];}}k--;}cout<<"Optimal train swapping takes "<<count<<" swaps."<<endl;}return 0;}