PAT T1010 Lehmer Code

跟1009几乎是同一道题~

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+;
int a[maxn];
int c[maxn*];
int r[maxn];
int lowbit (int x) {
    return x&-x;
}
int main () {
    int N;
    scanf ("%d",&N);
    for (int i=;i<N;i++) {
        scanf ("%d",&a[i]);
        a[i]+=;
    }
    for (int i=N-;i>=;i--) {
        for (int j=a[i]-;j>;j-=lowbit(j))
        r[i]+=c[j];
        for (int j=a[i];j<maxn;j+=lowbit(j))
        c[j]++;
    }
    for (int i=;i<N;i++) {
        if (i!=) printf (" ");
        printf ("%d",r[i]);
    }
    return ;
}