求数组的逆序对个数。如【3,5,1,15】,共有(3,1),(5,1)两对,逆序对个数为2;
1:显然这个可以用穷举的方法去做,类似于直接选择排序,复杂度n^2.
2:也可以用归并的方式去做,思路是:归并时,假设两个子数组已经排序,数组1在前,当前元素为x,数组2在后,当前元素为y,如果y<x,那么数组1中x和x之后的元素均与y构成一个逆序对。这样就可以统计出来了。
3:还可以用树状数组来做。每次插入时检查比他大的元素的个数。以下是思路1、思路2和思路3的代码:
#include<iostream>
#include<algorithm>
#include<iterator>
using namespace std;
void merge(int *p, int m, int mid, int n, int *ptmp);
int s = 0;
void merge_sort(int *p, int l, int r, int *ptmp)
{
if (l >= r)
return;
int m = l + (r - l) / 2;
merge_sort(p, l, m, ptmp);
merge_sort(p, m + 1, r, ptmp);
merge(p, l, m, r, ptmp);
copy(ptmp+l, ptmp + r+1, p + l);
}
void merge(int *p, int m, int mid, int n, int *ptmp)
{
int x = m;
int y = mid + 1;
int i = m;
while(x <= mid && y <= n)
{
if(p[x] <= p[y])
ptmp[i++] = p[x++];
else
{
ptmp[i++] = p[y++];
s += (mid - x + 1); // 归并排序上加这么一句就行
}
}
while(x <= mid) ptmp[i++] = p[x++];
while(y <= n) ptmp[i++] = p[y++];
}
int lowbit(int x)
{
return x & -x;
}
void modify(int *ap, int n, int pos, int v)
{
int i;
for (i=pos; i<= n; i += lowbit(i))
ap[i] += v;
}
int gsum(int *ap, int n, int pos)
{
int i;
int s = 0;
for (i=pos; i>=1; i -= lowbit(i) )
s += ap[i];
return s;
}
int main()
{
int a[] = {3,5,1,15,67,23,23,87,89,2};
// 1 // 暴力法计算逆序对
int x = 0;
int i, j;
for (i=0; i<10-1; i++)
for(j=i+1; j<10; j++)
if (a[i] > a[j])
x++;
cout<<"1.暴力法计算逆序对: "<<x<<endl;
// 2 归并法
int *p = new int [sizeof(a)/sizeof(int)];
merge_sort(a, 0, 9, p);
copy(a, a+10, ostream_iterator<int>(cout, " "));
cout<<endl;
//copy(p, p+10, ostream_iterator<int>(cout, " "));
//cout<<endl;
cout<<endl<<"2.归并法计算逆序对: "<<s<<endl;
delete []p;
int ab[] = {3,5,1,15,67,23,23,87,89,2};
// 3 树状数组法
int *ap = new int [100];
for (i = 0; i < 100; i++)
ap[i] = 0;
int ss = 0;
for (i=0; i<10; i++)
{
modify(ap, 100, ab[i], 1); // 插入
ss += (i+1 - gsum(ap, 100, ab[i])); // 计数。gsum返回包括当前元素在内的前若干项和,i+1为当前总元素个数。相减得到当前元素后面有几个元素。
}
cout<<endl<<"3.树状数组法: "<<ss<<endl;
delete []ap;
return 0;
}
输出:
1.暴力法计算逆序对: 12
1 2 3 5 15 23 23 67 87 89
2.归并法计算逆序对: 12
3.树状数组法: 12