Problem Description
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.
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
1 #include <iostream> 2 using namespace std; 3 int a[1005]; 4 int main() 5 { int n,m; 6 while(cin>>n) 7 { 8 m=0; 9 for(int i=0;i<n;i++){ 10 cin>>a[i]; 11 for(int j=i-1;j>=0;j--) 12 if(a[i]<a[j]) m++; 13 }cout<<m<<endl; 14 } 15 return 0; 16 }