LA 5902,Movie collection

#include <iostream>
#include <string.h>
#include <string>
#include <fstream>
#include <algorithm>
#include <stdio.h>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
using namespace std;
const double eps = 1e-8;
const double pi=acos(-1.0);
const int INF=0x7fffffff;
unsigned long long uINF = ~0LL;
#define MAXN 200007
#define mod 1000000007
typedef long long LL;
int C[MAXN],hash[MAXN],n,m,T,x,y;
int lowbit(int x)
{
    return x&-x;
}
int sum(int x)
{
    int ret=0;
    while(x>0)
    {
        ret+=C[x];x-=lowbit(x);
    }
    return ret;
}
void add(int x,int d)
{
    while(x<=MAXN){
    C[x]+=d;x+=lowbit(x);}
}
void init()
{
    for(int i=1;i<=n;i++)
    hash[i]=n-i+1;
    for(int i=1;i<=MAXN;i++)
    C[i]=lowbit(i);
}
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        //memset(hash,0,sizeof(hash));
        //memset(C,0,sizeof(C));
        init();
        int temp,N=n;
        for(int i=1;i<=m;i++)
        {
            scanf("%d",&temp);
            int ans=sum(hash[temp]);
            if(i!=1)printf(" %d",n-ans);
            else printf("%d",n-ans);

            add(hash[temp],-1);
            hash[temp]=++N;
        }
        printf("
");
    }
    return 0;
}

树状数组~