INVCNT  Inversion Count
Let A[0...n  1] be an array of n distinct positive integers. If i < j and A[i] > A[j] then the pair (i, j) is called an inversion of A. Given n and an array A your task is to find the number of inversions of A.
Input
The first line contains t, the number of testcases followed by a blank space. Each of the t tests start with a number n (n <= 200000). Then n + 1 lines follow. In the ith line a number A[i  1] is given (A[i  1] <= 10^7). The (n + 1)th line is a blank space.
Output
For every test output one line giving the number of inversions of A.
Example
Input: 2 3 3 1 2 5 2 3 8 6 1 Output: 2 5
hide comments
arun :
20141125 17:55:04
Real please AC in 1st go!!! use BIT


[Lakshman]:
20141112 12:19:45
@Abi you have declared count as long long and your mergesort is returning int , So declare mergesort and merge long long instead. Hope this helps. Last edit: 20141112 12:25:19 

Abi:
20141112 06:59:38
I dont know ....why iam getting WA :(


surayans tiwari(http://bit.ly/1EPzcpv):
20141108 12:29:10
acce using merge ,, got acc using fast i/o with bit Last edit: 20141108 12:44:38 

Vikas:
20141012 15:39:58
I am getting WA even after checking my code many times.Please help.


vikax:
20140925 13:49:41
3 RTE coz of a silly mistake...... finally ac 

Siya:
20140923 12:49:05
AC in first chance :) 

saumya:
20140914 14:09:45
same as http://www.spoj.com/problems/CODESPTB/


Gaurav Ahirwar:
20140830 13:29:12
0.70 secs AC! :D 

ankur manchanda:
20140722 10:18:51
declare variable count as long long int.

Added by:  Paranoid Android 
Date:  20100306 
Time limit:  3.599s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: PERL6 