树状数组求逆序对WA求调

#include<bits/stdc++.h>

using namespace std;

const int N = 1e6+5;
#define int long long
int n,m,tr[N];

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

void add(int x,int c){
    while(x<=n){
        tr[x]+=c;
        x+=lowbit(x);
    }
}

int query(int x){
    int cnt = 0;
    while(x){
        cnt+=tr[x];
        x-=lowbit(x);
    }    
    return cnt;
}

signed main(){
    cin>>n;
    int cnt = 0;
    for(int i = 1,tmp;i<=n;i++){
        cin>>tmp;
        add(tmp,1);
        cnt+=(i-query(tmp));
    }
    cout<<cnt;

    return 0;
}