HDU 2689 Sort it(树状数组，逆序数)

Sort it

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3555    Accepted Submission(s): 2578

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.

 

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
  
  

 

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define size 1001

int c[size];

inline int lowbite(int x)
{
	return x & (-x);
}

void add(int k)//向上更新
{
	while(k <= size)
	{
		c[k]++;
		k += lowbite(k);
	}
}

int sum(int k)  //向下更新
{
	int s = 0; 
	while(k)
	{
		s += c[k];
		k -= lowbite(k);
	}

	return s;
}

int main()
{
	int x,y,n,i;
    int ans;

	while(~scanf("%d",&n))
	{
	   memset(c,0,sizeof(c));

       for(i=ans=0;i<n;i++)
	   {
		   scanf("%d",&x);
		   add(x);
		   ans += i - sum(x-1);//坐标减去在他前面比他小的个数
	   }

	   printf("%d\n",ans);
	}

	return 0;
}