frosh week HDU 树状数组求逆序数

解析看这里一文教你树状数组如何求逆序数https://blog.csdn.net/zlq7777/article/details/122417173

 ans+=i-getsum(t[i].id);sum += query(reflect[i]) - 1;都行，两种逆序数计数方法选择而已

#include<bits/stdc++.h>
using namespace std;
int n;
typedef long long ll;
int reflect[1000005],c[1000005];
struct node{
	int val;
	int pos;
}a[1000005];
bool cmp(node a,node b){
	return a.val<b.val;
}
int lowbit(int x){
	return x&(-x);
}
int update(int i,int k){
	while(i<=n){
		c[i]+=k;
		i+=lowbit(i); 
	}
}
int getsum(int i){
	int ans=0;
	while(i>0){
		ans+=c[i];
		i-=lowbit(i); 
	}
	return ans;
}
int main(){
	while(~scanf("%d",&n)){
		memset(c,0,sizeof(c));
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i].val);
			a[i].pos=i;
		}
		sort(a+1,a+1+n,cmp);
		ll ans=0;
		for(int i=n;i>=1;i--){
			update(a[i].pos,1);
			ans+=getsum(a[i].pos)-1;
		}
		printf("%lld\n",ans);
	}
}

标签：week,node,HDU,int,1000005,求逆,pos,ans,序数
来源： https://blog.csdn.net/zlq7777/article/details/122422039