Swaps and Inversions

题目描述

Long long ago, there was an integer sequence a.
Tonyfang think this sequence is messy, so he will count the number of inversions in this sequence. Because he is angry, you will have to pay x yuan for every inversion in the sequence.
You don't want to pay too much, so you can try to play some tricks before he sees this sequence. You can pay y yuan to swap any two adjacent elements.
What is the minimum amount of money you need to spend?
The definition of inversion in this problem is pair (i,j) which 1≤i<j≤n and ai>aj.

 

输入

There are multiple test cases, please read till the end of input file.
For each test, in the first line, three integers, n,x,y, n represents the length of the sequence.
In the second line, n integers separated by spaces, representing the orginal sequence a.
1≤n,x,y≤100000, numbers in the sequence are in [−109,109]. There're 10 test cases.

 

输出

For every test case, a single integer representing minimum money to pay.

 

样例输入

3 233 666
1 2 3
3 1 666
3 2 1

 

样例输出

0
3

求逆序对的题目，可以树状数组，可以归并排

#include<bits/stdc++.h>
#include<cstdio>
using namespace std;
typedef long long ll;
ll a[100050],b[100050],cnt;
ll fun(ll l,ll mid,ll r)
{
    if(l!=r)
    {
        cnt=fun(l,(l+mid)/2,mid)+fun(mid+1,(mid+r+1)/2,r);
    }
    else
    {
        return 0;
    }
    ll i=l,j=mid+1;
    for(ll k=l; k<=r; k++)
    {
        if(j>r||(i<=mid&&a[i]<=a[j]))
        {
            b[k]=a[i++];
        }
        else
        {
            b[k]=a[j++],cnt+=mid-i+1;
        }
    }
    for(ll k=l; k<=r; k++)
    {
        a[k]=b[k];
    }
    return cnt;
}
int main()
{
    ll n,ans,x,y;
    while(scanf("%lld%lld%lld",&n,&x,&y)!=EOF)
    {
        memset(b,0,sizeof(b));
        cnt=0;
        for(ll i=1; i<=n; i++)    scanf("%lld",&a[i]);
        ans=fun(1,(1+n)/2,n);
//        cout<<ans<<endl;
        if(x>y)
        {
            printf("%lld\n",(long long)ans*y);
        }
        else
        {
            printf("%lld\n",(long long)ans*x);
        }
    }
    return 0;
}