Sort it(冒泡排序)

Sort it(冒泡排序）

You want to processe a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. Then how many times it need.
For example, 1 2 3 5 4, we only need one operation : swap 5 and 4.

Input

The input consists of a number of test cases. Each case consists of two lines: the first line contains a positive integer n (n <= 1000); the next line contains a permutation of the n integers from 1 to n.

Output

For each case, output the minimum times need to sort it in ascending order on a single line.

Sample Input

3
1 2 3
4
4 3 2 1

Sample Output

0
6
分析：相邻数字每交换一次，标志数tag+1;
AC代码：

#include <iostream>
#include<stdio.h>
using namespace std;

int main()
{
    int n,tmp;
    while(~scanf("%d",&n))
    {
        int a[1000];
        int tag=0;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n-i-1;j++)
            {
                if(a[j]>a[j+1])
                {
                    tmp=a[j];
                    a[j]=a[j+1];
                    a[j+1]=tmp;
                    tag++;
                }
            }
        }
    printf("%d\n",tag);
    }
    return 0;
}