hdu 5775 Bubble Sort 树状数组+冒泡排序

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
const int maxn=100000+9;
int n,ans[maxn],a[maxn],b[maxn],c[maxn];  
//b[i]储存第i个元素右边有几个比它小的元素,ans[i]记录数字i对应的答案
int lowbit(int x)
{
    return x&-x;
}

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

int query(int x)
{
    int ans=0;
    while(x>0)
    {
        ans+=c[x];
        x-=lowbit(x);
    }
    return ans;
}
int main()
{
    int T;
    cin>>T;
    for(int k=1;k<=T;k++)
    {
        cin>>n;
        memset(c,0,sizeof(c));
        for(int i=1;i<=n;i++) scanf("%d",&a[i]);
        for(int i=n;i>0;i--)
        {
            b[i]=query(a[i]);
            update(a[i]);
        }
        for(int i=1;i<=n;i++)
            ans[a[i]]=i+b[i]-min(i,a[i]);
        printf("Case #%d:",k);
        for(int i=1;i<=n;i++)
            printf(" %d",ans[i]);
        cout<<endl;
    }
    return 0;
}