看了好久才终于大概明白了…
首先是最基本的树状数组边构建边求逆序对:
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define lowbit(x) (x&-x)
const int maxn = 1e6+10;
int tree[maxn]={0},result;
void add(int x)
{
while(x<=maxn) tree[x]++, x+= lowbit(x);
}
int query(int x)
{
int ans=0;
while(x) ans+=tree[x],x-=lowbit(x);
return ans;
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
int t;
cin>>t;
add(t);
result += i - query(t);
}
cout<<result;
return 0;
}
但是可能因为输入的数太大而无法存入数组中(数的大小超过数组个数所能达到的上限)
所以需要离散化处理:
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define lowbit(x) (x&-x)
const int maxn = 1e6+10;
int aa[maxn];//离散化后的数组
int c[maxn]; //树状数组
int n;
struct Node
{
int v;
int order;
bool operator < (const Node x) const{
return v < x.v;
}
} a[maxn];
void update(int t, int value)
{
for (int i = t; i <= n; i += lowbit(i)) c[i] += value;
}
int getsum(int t)
{
int sum = 0;
for (int i = t; i >= 1; i -= lowbit(i)) sum += c[i];
return sum;
}
int main(){
while(cin>>n)
{
for (int i = 1; i <= n; i++) //离散化
{
cin>>a[i].v;
a[i].order = i;//用序号构筑映射
}
sort(a + 1, a + n + 1);//从1到n排序
memset(c, 0, sizeof(c));//初始化树状数组
for (int i = 1; i <= n; i++) aa[a[i].order] = i;
long long ans = 0;
for (int i = 1; i <= n; i++)
{
update(aa[i], 1);
ans += i - getsum(aa[i]); //减去小于的数即为大于的数即为逆序数
}
cout<<ans;
}
return 0;
}
`