Problem Description
对于数列a1,a2,a3…中的任意两个数ai,aj (i < j),如果ai > aj,那么我们就说这两个数构成了一个逆序对;在一个数列中逆序对的总数称之为逆序数,如数列 1 6 3 7 2 4 9中,(6,4)是一个逆序对,同样还有(3,2),(7,4),(6,2),(6,3)等等,你的任务是对给定的数列求出数列的逆序数。
Input
输入数据N(N <= 100000)表示数列中元素的个数,随后输入N个正整数,数字间以空格间隔。
Output
输出逆序数。
Sample Input
10
10 9 8 7 6 5 4 3 2 1
Sample Output
45
#include <stdio.h>
#include <string.h>
long long a[100005], t[100005], re;
void add(long long s1, long long e1, long long s2, long long e2)
{
long long top, num1, num2, num, i;
top = 0;
num1 = s1;
num2 = s2;
while(num1<=e1&&num2<=e2)
{
if(a[num1]<=a[num2]) t[top++] = a[num1++];
else
{
t[top++] = a[num2++];
re = re + (e1-num1+1);
}
}
while(num1<=e1)
{
t[top++] = a[num1++];
}
while(num2<=e2)
{
t[top++] = a[num2++];
}
num = 0;
for(i=s1; i<=e2; i++)
{
a[i] = t[num++];
}
}
void Sort(long long left, long long right)
{
if(left>=right) return;
else
{
long long mid;
mid = (left + right) / 2;
Sort(left, mid);
Sort(mid+1, right);
add(left, mid, mid+1, right);
}
}
int main()
{
long long n, i;
scanf("%lld", &n);
for(i=0;i<n;i++)
{
scanf("%lld", &a[i]);
}
re = 0;
Sort(0, n-1);
printf("%lld\n", re);
return 0;
}