hdu2689 Sort it

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.

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

AC Code

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <limits.h>
#include <queue>
#define inf 0x3f3f3f3f
#define MAXM 200005
#define MOD 10
using namespace std;
const double pi=3.141592653589793239,e=2.7182818284590452354;

int n,c[10000];

int lowbit(int i)
{
	return i&(-i);
}

void update(int i,int x)
{
	while(i<=n)
	{
		c[i]+=x;
		i+=lowbit(i);
	}
}

int query(int i)
{
	int sum=0;
	while(i>0)
	{
		sum+=c[i];
		i-=lowbit(i);
	}
	return sum;
}

int main(int argc, char** argv) {
	while(cin>>n){
		int i,sum=0;
		memset(c,0,sizeof(c));
		for(i=1;i<=n;i++)
		{
			int tmp;
			cin>>tmp;
			update(tmp,1);
			sum+=i-query(tmp);
		}
		cout<<sum<<endl;
	}
	return 0;
}