Uva - 1513 Moive collection ( 模拟栈 + 树状数组基本操作 )

/* ***********************************************
ID      : whiteblock63
LANG    : G++
PROG    : Uva - 1513 Moive collection
DATE    : 2014-10-08 20:53:44
************************************************ */

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define CLR( a, b )        memset( a, b, sizeof(a) )
using namespace std;
#define MAXN 200005

int bit[MAXN];
int hash[MAXN];
void scan( int &x )
{
    char c;
    while( c = getchar(), c < ‘0‘ || c > ‘9‘ );
    x = c - ‘0‘;
    while( c = getchar(), c >= ‘0‘ && c <= ‘9‘ )    x = x*10 + c - ‘0‘;
}

void out( int x )
{
    if( x > 9 ) out( x/10 );
    putchar( x%10 + ‘0‘ );
}


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

void add( int x, int val )
{
    while( x <= MAXN )
    {
        bit[x] += val;
        x += lowbit( x );
    }
}

int sum( int x )
{
    int ret = 0;
    while( x > 0 )
    {
        ret += bit[x];
        x -= lowbit( x );
    }
    return ret;
}

void Orz()
{
    int t, n, m, x ;
    scan( t );
    while( t-- )
    {
        scan( n ), scan( m );    
        CLR( bit, 0 );
        CLR( hash, 0 );
        for( int i = 1; i <= n; ++i )
        {
            hash[i] = i + 100000;
            add( hash[i], 1 );
        }
        for( int i = 0; i < m; ++i )
        {
            scan( x );
            int ans = sum( hash[x]-1 );
            add( hash[x], -1 );
            hash[x] = 100000 - i;
            add( hash[x], 1 );
            if( i != 0 )
            {
                putchar( ‘ ‘ );
                out( ans );
            }
            else    
                out( ans );
            
        }
        putchar( ‘\n‘ );
    }
}

int main()
{
    Orz();
    return 0;
}