群赛

http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=8669#overview

A题水题；

B题没看懂题意

C题还有点意思，我用到树桩数组，因为每次都是把一个movie移动到顶部，说可以插入到数组下标的一端而不是从0开始；

D题没看懂题意

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>

#define inf 0x3f3f3f3f
#define Inf 0x3FFFFFFFFFFFFFFFLL
#define maxn 100010
#define lowbit(x) x&(-x)

using namespace std;
int pos[maxn];
int d[2*maxn],Max;

void insert(int pos,int x)
{
    for(int i=pos;i<=Max;i+=lowbit(i))
       d[i]+=x;
}
int query(int pos)
{
    int sum=0;
    for(int i=pos;i>0;i-=lowbit(i)) sum+=d[i];
    return sum;
}

int main()
{
    int T, a, b, t, top,n,m;
    scanf("%d", &T);
    for (; T--; )
    {
         scanf("%d %d",&n,&m);
         memset(d,0,sizeof(d));
         Max=n+m;
         for(int i=1;i<=n;i++) insert(i,1),pos[i]=n-i+1;
         int a;
         for(int i=0;i<m;i++)
         {
             scanf("%d",&a);
             int ans=n-query(pos[a]);
             insert(pos[a],-1);
             pos[a]=n+i+1;
             insert(n+i+1,1);
             if(i) printf(" ");
             printf("%d",ans);
         }
         puts("");
    }
    return 0;
}