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
iamjacksparrow: 2019-01-18 23:37:10

used bit to solve

striver_79: 2019-01-17 09:09:39

Try solving https://codeforces.com/problemset/problem/459/D after you solve this.

marethyu1: 2019-01-01 20:58:36

Use long long when counting inversions, it cost me several WAs!

tien0903: 2018-12-23 15:58:33

why others is AC with int althought it has already big number but this one have 2 use long in c++
?? why ??

yaseenmollik: 2018-12-10 23:16:10

Used merge sort..Be careful to use long type instead of integer for count variable. Got wrong answer just for this mistake..

manuparmar35: 2018-11-14 19:33:58

Fenwick Tree :: AC in one go :)

r15habhgup11: 2018-10-30 11:05:02

solved using fenwick tree. ac in one go :)

eng_hardik: 2018-10-28 20:15:46

Use long in JAVA for storing the inversion-count to avoid WA

salman3007: 2018-10-10 16:22:44

beautiful use of merge_sort

kishan75: 2018-10-10 07:52:45

can anyone tell me constraints of test case T


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