原文地址
求逆序数有两种方法:归并排序和树状数组
#include<stdio.h>
#include <cmath>
#include <algorithm>
#include <iostream>
#define maxn 1000005
using namespace std;
int a[maxn],temp[maxn];
long long sum;
void merge1(int l,int r,int m){
int i = l, j = m + 1,k = l;
while(i<=m&&j<=r){
if(a[i] > a[j]){
sum += m - i + 1;
temp[k++] = a[j++];
}else{
temp[k++] = a[i++];
}
}
while(i<=m)
temp[k++] = a[i++];
while(j<=r)
temp[k++] = a[j++];
for(i = l;i<=r;i++)
a[i] = temp[i];
}
void mergesort(int l,int r){
if(l<r){
int m = (l + r) / 2;
mergesort(l,m);
mergesort(m+1,r);
merge1(l,r,m);
}
}
int main(){
int n,x,y;
while(scanf("%d%d%d",&n,&x,&y)==3)
{
for(int i = 0;i < n;i++){
scanf("%d",&a[i]);
}
sum = 0;
mergesort(0,n-1);
sum=sum*min(x,y);
printf("%lld\n",sum);
}
return 0;
}