1 归并排序
#include <stdio.h>
#include<iostream>
using namespace std;
#define max 1000001
long long a[max],b[max];
long long count;
void Merge(long long a[], int start, int mid , int end) //归并排序的合并部分
{
int i = start,j = mid + 1,k = start;
while(i <= mid&&j <= end)
{
if(a[i] <= a[j])
{
b[k++] = a[i++];
}
else
{
count += j - k;
b[k++] = a[j++];
}
}
while(i <= mid)
{
b[k++] = a[i++];
}
while(j <= end)
{
b[k++] = a[j++];
}
for(int i = start; i <= end; i++)
{
a[i] = b[i];
}
}
void MergeSort(long long a[], int start, int end) //归并排序
{
if(start < end)
{
int mid = (start + end)/2;
MergeSort(a,start,mid); // 将前半部分排序
MergeSort(a,mid+1,end);
// 将后半部分排序
Merge(a,start,mid,end); // 合并前后两个部分
}
}
int main(int argc, char const *argv[])
{
int m;
while(~scanf("%d",&m))
{
count = 0;
for(int i = 0; i < m; i++)
{
scanf("%d",a+i);
}
MergeSort(a,0,m-1);
printf("%lld\n",count);
}
return 0;
}
2 树状数组
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=500010;
int n,bit[N],a[N];
struct node{
int val;
int pos;//离散化后的值
}p[N];
bool cmp(node a,node b)
{
return a.val<b.val;
}
void add(int k)
{
while(k<=n)
{
bit[k]+=1;
k+=k&-k;
}
}
int sum(int k)
{
int sum=0;
while(k)
{
sum+=bit[k];
k-=k&-k;
}
return sum;
}
void solve()
{
for(int i=1;i<=n;i++)
{
scanf("%d",&p[i].val);
p[i].pos=i;
}
sort(p+1,p+n+1,cmp);
for(int i=1;i<=n;i++)
a[p[i].pos]=i;//离散化后的结果//就是将原来输入的数,按照输入顺序,大小,转化成1-n的数据
long long ans=0;
for(int i=1;i<=n;i++)
bit[i]=0;//初始化树状数组
for(int i=1;i<=n;i++)
{
add(a[i]);
ans+=i-sum(a[i]);
}
printf("%I64d\n",ans);
}
int main()
{
while(~scanf("%d",&n)&&n)
{
solve();
}
}