J - Swaps and Inversions HDU - 6318 树状数组+离散化

题解 :第一种是逆序数对的个数*x，第二种最小交换次数也是逆序数对的个数*y，直接取最小值

细节就是需要离散化，不然会爆

#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
const int maxn=2e5+10;
typedef long long ll;
int n,x,y;
ll c[maxn];int b[maxn];
struct node{
    int v,id;
}a[maxn];
bool cmp(node a,node b){
    return a.v<b.v;
}
int lowbit(int x){
    return x&(-x);
}
void update(int x,int d){
    while(x<=n){
        c[x]+=d;
        x+=lowbit(x);
    }
}
int query(int x){
    int sum=0;
    while(x>0){
        sum+=c[x];
        x-=lowbit(x);
    }
    return sum;
}
int main()
{
    while(scanf("%d%d%d",&n,&x,&y)!=EOF){
        memset(c,0,sizeof(c));
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i].v);
            a[i].id=i;
        }
        sort(a+1,a+n+1,cmp);
        int cnt=1;
        for(int i=1;i<=n;i++){
            if(i!=1&&a[i].v!=a[i-1].v)cnt++;
            b[a[i].id]=cnt;
        }
        ll sum=0;
        for(int i=1;i<=n;i++){
            update(b[i],1);
            sum+=i-query(b[i]);
        }
        printf("%lld\n",min(x*sum,y*sum));
        
    }
    return 0;
}