在一个排列中,如果一对数的前后位置与大小顺序相反,即前面的数大于后面的数,那么它们就称为一个逆序。一个排列中逆序的总数就称为这个排列的逆序数。
如2 4 3 1中,2 1,4 3,4 1,3 1是逆序,逆序数是4。给出一个整数序列,求该序列的逆序数。
Input
第1行:N,N为序列的长度(n <= 50000) 第2 - N + 1行:序列中的元素(0 <= A[i] <= 10^9)
Output
输出逆序数
Input示例
4 2 4 3 1
Output示例
4
求逆序数,用暴力时间复杂度为O(n^2)肯定会超时
有两种方法归并和树状数组。
归并:
#include
#include
#include
using namespace std;
const int N = 50001;
int a[N];
int b[N];
int n;
int ans;
int slove(int top, int tail)
{
if(top < tail)
{
int mid = (top+tail)/2;
slove(top, mid);
slove(mid+1, tail);
int k = top;
int i = top;
int j = mid+1;
while(i <= mid && j <= tail)
{
if(a[i] < a[j])
{
b[k++] = a[i++];
}
else
{
b[k++] = a[j++];
ans += mid-i+1;
}
}
while(i <= mid) b[k++] = a[i++];
while(j <= tail) b[k++] = a[j++];
for(i = top; i <= tail; i++) a[i] = b[i];
}
return 0;
}
int main(void)
{
while(~scanf("%d", &n))
{
int i, j;
ans = 0;
for(i = 0; i < n; i++) scanf("%d", &a[i]);
slove(0, n-1);
// for(i = 0 ; i < n; i++)
// printf("%d ", a[i]);printf("\n");
printf("%d\n", ans);
}
return 0;
}
#include
#include
using namespace std;
int a[50001];
int b[50001];
int con = 0;
int Merge(int a[], int b[], int top, int tail, int mid)
{
int i = top;
int j = mid+1;
int k = top;
while(i <= mid && j <= tail)
{
if(b[i] < b[j]) a[k++] = b[i++];
else
{
a[k++] = b[j++];
con += mid-i+1;//比i~mid的大
}
}
while(i <= mid) a[k++] = b[i++];
while(j <= tail) a[k++] = b[j++];
return 0;
}
int merSort(int a[], int b[], int top, int tail)
{
if(top < tail)
{
int mid = (top+tail)/2;
merSort(b, a, top, mid);
merSort(b, a, mid+1, tail);
Merge(a, b, top, tail, mid);
}
return 0;
}
int main(void)
{
int n;
while(~scanf("%d", &n))
{
con = 0;
int i = 0;
for(i = 0; i < n; ++i)
{
scanf("%d", &a[i]); b[i] = a[i];
}
merSort(a, b, 0, n-1);
printf("%d\n", con);
}
return 0;
}