A - Ultra-QuickSort OpenJ_Bailian - 2299（离散化求逆序对/归并排序）

In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. For the input sequence
9 1 0 5 4 ,

Ultra-QuickSort produces the output
0 1 4 5 9 .

Your task is to determine how many swap operations Ultra-QuickSort needs to perform in order to sort a given input sequence.
Input
The input contains several test cases. Every test case begins with a line that contains a single integer n < 500,000 – the length of the input sequence. Each of the the following n lines contains a single integer 0 ≤ a[i] ≤ 999,999,999, the i-th input sequence element. Input is terminated by a sequence of length n = 0. This sequence must not be processed.
Output
For every input sequence, your program prints a single line containing an integer number op, the minimum number of swap operations necessary to sort the given input sequence.
Sample Input
5
9
1
0
5
4
3
1
2
3
0
Sample Output
6
0

离散化求逆序对（排个序就离散化了，并不需要去重）

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;

const ll maxn = 5e5 + 7;
ll a[maxn],c[maxn],b[maxn],n;
ll num[maxn],cnt;

ll query(ll x)
{
    return lower_bound(b + 1,b + 1 + n,x) - b;
}

ll lowbit(ll x)
{
    return x & (-x);
}

void add(ll x,ll v)
{
    while(x <= maxn)
    {
        c[x] += v;
        x += lowbit(x);
    }
}

ll sum(ll x)
{
    ll res = 0;
    while(x)
    {
        res += c[x];
        x -= lowbit(x);
    }
    return res;
}

int main()
{
    while(~scanf("%lld",&n) && n)
    {
        cnt = 0;
        memset(c,0,sizeof(c));
        for(ll i = 1;i <= n;i++)
        {
            scanf("%lld",&a[i]);b[i] = a[i];
        }
        sort(b + 1,b + 1 + n);

        ll ans = 0;
        for(ll i = 1;i <= n;i++)
        {
            ll pos = query(a[i]);
            add(pos,1);
            ans += sum(500005) - sum(pos);
        }
        printf("%lld\n",ans);
    }
    return 0;
}

归并排序求逆序对，个人感觉就是在归并排序的过程中，算出右半部分的数，在左边部分能组成多少个逆序对数。因为是分治，每个半块不会重复，然后递归的求解。

#include <cstdio>

const int maxn = 5e5 + 7;
typedef long long ll;
int a[maxn],b[maxn];

ll merge(int *a,int *b,int i,int j)
{
    if(i == j)return 0;
    ll ans = 0;
    int mid = (i + j) >> 1;
    ans += merge(a,b,i,mid);
    ans += merge(a,b,mid + 1,j);
    
    int p = i,q = mid + 1,k = i;
    while(p <= mid || q <= j)
    {
        if(p > mid || (q <= j && a[p] > a[q]))
        {
            b[k++] = a[q++];
            ans += mid - p + 1;//q在左半部分得到的逆序对数
        }
        else
        {
            b[k++] = a[p++];
        }
    }
    for(k = i;k <= j;k++)
        a[k] = b[k];
    return ans;
}

int main()
{
    int n;
    while(~scanf("%d",&n) && n)
    {
        for(int i = 0;i < n;i++)
        {
            scanf("%d",&a[i]);
        }
        printf("%lld\n",merge(a,b,0,n - 1));
    }
    return 0;
}