Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

The Number of Inversions

For a given sequence $A = \{a_0, a_1, ... a_{n-1}\}$, the number of pairs $(i, j)$ where $a_i > a_j$ and $i < j$, is called the number of inversions. The number of inversions is equal to the number of swaps of Bubble Sort defined in the following program:

bubbleSort(A)
cnt = 0 // the number of inversions
for i = 0 to A.length-1
for j = A.length-1 downto i+1
if A[j] < A[j-1]
swap(A[j], A[j-1])
cnt++

return cnt

For the given sequence $A$, print the number of inversions of $A$. Note that you should not use the above program, which brings Time Limit Exceeded.

Input

In the first line, an integer $n$, the number of elements in $A$, is given. In the second line, the elements $a_i$ ($i = 0, 1, .. n-1$) are given separated by space characters.

output

Print the number of inversions in a line.

Constraints

$ 1 \leq n \leq 200,000$

$ 0 \leq a_i \leq 10^9$

$a_i$ are all different

Sample Input 1

5
3 5 2 1 4

Sample Output 1

6

Sample Input 2

3
3 1 2

Sample Output 2

2

Solution in C (judge verdict: Accepted)

#include<stdio.h>

#define MAX 500000
#define SENTINEL 2000000000
typedef long long llong;

int L[MAX/2+2],R[MAX/2+2];

llong merge(int a[MAX],int left,int mid,int right){
	int i,j,k;
	llong cnt=0;
	int n1=mid-left;
	int n2=right-mid;
	for(i=0;i<n1;i++)L[i]=a[left+i];
	for(i=0;i<n2;i++)R[i]=a[mid+i];
	L[n1]=R[n2]=SENTINEL;
	i=0;
	j=0;
	for(k=left;k<right;k++){
		if(L[i]<=R[j]){
			a[k]=L[i++];
		}
		else{
			a[k]=R[j++];
			cnt+=n1-i;
		}
	}
	
	return cnt;
}

llong mergeSort(int a[MAX],int left,int right){
	llong v1,v2,v3;
	if(left+1<right){
		int mid=(left+right)/2;
		v1=mergeSort(a,left,mid);
		v2=mergeSort(a,mid,right);
		v3=merge(a,left,mid,right);
		return v1+v2+v3;
	}else return 0;
}

int main(void){
	int a[MAX],n;
	
	scanf("%d",&n);
	for(int i=0;i<n;i++)scanf("%d",&a[i]);
	
	llong ans=mergeSort(a,0,n);
	
	printf("%lld\n",ans);
	
	return 0;
}