POJ 2299 Ultra-QuickSort

POJ 2299 Ultra-QuickSort

POJ入口：http://poj.org/problem?id=2299
参考网址：https://blog.csdn.net/jk_chen_acmer/article/details/79347003
https://blog.csdn.net/weixin_43272781/article/details/83658819
使用模版【模版】树状数组

AC代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int MAXN = 5e5+10;
#define lowbit(a) ((a)&(-a))    //取最低位1与后续0构成数
#define mm(a) memset(a, 0, sizeof(a))
int ori[MAXN];
int sum[MAXN];
int nindex[MAXN];
struct node{
    int val, index;
    bool operator < (const node &b) const{
        return val < b.val;
    }
}a[MAXN];
int n;
//1.单点修改+区间查询
void add(int p, int x){ //单点修改 给位置p增加x
    while (p <= n){
        sum[p] += x;
        p += lowbit(p);
    }
}
int query(int p){   //求位置p的前缀和
    int ret = 0;
    while (p > 0){
        ret += sum[p];
        p -= lowbit(p);
    }
    return ret;
}
int main(){
    while (~scanf("%d", &n) && n){
        mm(sum);
        for (int i = 1; i <= n; i++){
            scanf("%d", &a[i].val);
            a[i].index = i;
        }
        sort(a+1, a+1+n);
        for (int i = 1; i <= n; i++) nindex[a[i].index] = i;
        LL ret = 0;
        for (int i = 1; i <= n; i++){
            add(nindex[i], 1);
            ret += i-query(nindex[i]);
        }
        printf("%lld\n", ret);
    }
    return 0;
}