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
输出逆序数。
Example Input
10 10 9 8 7 6 5 4 3 2 1
Example Output
45
code:
#include <bits/stdc++.h>
using namespace std;
int a[100001], n, i, j, temp[100001];
long long sum;
void pai(int a[], int l1, int r1, int l2, int r2)
{
int k = 0;
int a1 = l1, a2 = l2;
while(a1 <= r1 && a2 <= r2)
{
if(a[a1] <= a[a2])
{
temp[k++] = a[a1++];
}
else
{
temp[k++] = a[a2++];
sum = sum + (r1 - a1 +1);
}
}
while(a1 <= r1)
temp[k++] = a[a1++];
while(a2 <= r2)
temp[k++] = a[a2++];
for(int i = l1; i <= r2; i++)
a[i] = temp[i-l1];
}
void gui(int a[], int l, int r)
{
if(l < r)
{
int mid = (l+r)/2;
gui(a, l, mid);
gui(a, mid+1, r);
pai(a, l, mid, mid+1, r);
}
}
int main()
{
while(~scanf("%d", &n))
{
for(i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
sum = 0;
gui(a, 0, n-1);
cout << sum << endl;
}
return 0;
}