uva 299 - Train Swapping

统计冒泡排序的次数。。。

#include<cstdio>#include<algorithm>using namespace std;int cnt;int main(){    int N;    scanf("%d",&N);    while(N--)    {        int L,i,j;        scanf("%d",&L);        int number[L];        for(i = 0; i < L; i++)            scanf("%d",&number[i]);        cnt = 0;        if(L == 0 || L == 1 )        {            printf("Optimal train swapping takes %d swaps.\n",cnt);            continue;        }        for(i = 0 ; i < L-1; i++)            for(j = 0 ; j < L-i-1 ;j++)            if(number[j] > number[j+1])            {                int temp;                temp = number[j];number[j] = number[j+1]; number[j+1] = temp;                cnt++;            }        printf("Optimal train swapping takes %d swaps.\n",cnt);    }    return 0;}