299-Train Swapping

<br /> /* <br /> "Train Swapping"<br /> Level:1.0<br /> Date:2006/9/25<br /> 技巧:Bubble sort <br /> */<br /> <br /> #include <stdio.h><br /> #define LEN 51<br /> main(){<br /> int n=0,length=0,i=0,j=0,tmp=0,count=0;<br /> int train[LEN]={0};<br /> scanf("%d",&n);<br /> while(n-- > 0){<br /> scanf("%d",&length);<br /> for(i=0;i < length;i++) scanf("%d",&train[i]); for(i=0;i < length;i++){ for(j=i+1;j < length;j++){ if(train[i] > train[j]){<br /> tmp = train[i];<br /> train[i]=train[j];<br /> train[j]=tmp;<br /> count++; <br /> } <br /> } <br /> }<br /> printf("Optimal train swapping takes %d swaps.\n",count);<br /> count=0;<br /> } <br /> }<br /> <br />