Ultra-QuickSort POJ - 2299（树状数组，逆序对，一题两做）

之前在暑期集训的时候学过归并排序求逆序对的方法
代码

#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#define mem(a,n) memset(a,n,sizeof(a))
#define FRER() freopen("input.txt", "r", stdin)
#define FREW() freopen("output.txt", "r", stdin)
typedef long long LL;
using namespace std;
const int inf = 0x3f3f3f3f, maxn = 1000000 + 10;

int v[maxn];
int t[maxn];
LL ans;

void Merge(int L,int mid,int R)
{
    int i=L,j=mid+1;
    int m=mid,n=R;
    int k=0;
    while(i<=m&&j<=n){
        if(v[i]<v[j])
            t[k++]=v[i++];
        else {
            t[k++]=v[j++];
            ans+=m-i+1;
        }
    }
    while(i<=m)
        t[k++]=v[i++];
    while(j<=n)
        t[k++]=v[j++];
    for(int i=0;i<k;i++)
        v[L+i]=t[i];
}

void MergeSort(int L,int R)
{
    if(L<R){
        int mid=(L+R)/2;
        MergeSort(L,mid);
        MergeSort(mid+1,R);
        Merge(L,mid,R);
    }
}

int main()
{
    // FRER();
    int n;
    while(~scanf("%d",&n)&&n){
        for(int i=0;i<n;i++){
            scanf("%d",&v[i]);
        }
        ans=0;
        MergeSort(0,n-1);
        printf("%lld\n", ans);
    }
    return 0;
}

今天学习了树状数组想试一下用离散化+树状数组
这也是在我的上一篇博客的那个树状数组题目的到的启发

#include <bits/stdc++.h>
#define lowbit(x)  (x & -x)
using namespace std;
typedef long long ll;

const int maxn = 5e5 + 100;

struct sc {
    ll val, id;
    bool operator < (const sc & rhs) {
        return val < rhs.val;
    }
}no[maxn];

ll v[maxn];
ll C[maxn];
ll n;

ll sum(ll x) {
    ll ret = 0;
    while(x > 0) {
        ret += C[x]; x -= lowbit(x);
    }
    return ret;
}

void add(ll x, ll d) {
    while(x <= n) {
        C[x] += d; x += lowbit(x);
    }
}


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //freopen("i.txt", "r", stdin);
    while(cin >> n) {
        if(n==0) break;
        for(int i = 1; i <= n; i++) {
            cin >> no[i].val;
            no[i].id = n - i + 1;
        }
        sort(no+1, no+1+n);
        for(ll i = 1; i <= n; i++) {
            v[no[i].id] = i;
        }
        memset(C,0,sizeof(C));
        ll ans = 0;
        for(ll i = 1; i <= n; i++) {
            add(v[i], 1);
            ans += sum(v[i] - 1);
        }
        cout << ans << endl;
    }
    return 0;
}