SPOJ NWERC11C Movie collection 树状数组，线段树

//树状数组，用id[]标记，只是insert的点，不更改原来的值，然后将插入的下表记录到id[]中
//和 uva 11987 Almost Union-Find类似，不过此题是和并查集相关的
//莫非这就是可持续化吗？？？待研究。。。
#include <cstdio>
#include <ctime>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <string>
#include <set>
#include <stack>
#include <map>
#include <cmath>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bitset>
using namespace std;

//LOOP
#define FE(i, a, b) for(int i = (a); i <= (b); ++i)
#define FED(i, b, a) for(int i = (b); i>= (a); --i)
#define REP(i, N) for(int i = 0; i < (N); ++i)
#define CLR(A,value) memset(A,value,sizeof(A))
//INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RS(s) scanf("%s", s)
typedef long long LL;
const int INF = 1000000000;
const int MOD = 1000000007;
const double eps = 1e-10;
const int MAXN = 200100;

int s[MAXN];
int id[MAXN];
int n, N;
const int M = 100010;
int pos;///下一个可加点的位置

int lowbit(int x) { return x & (-x); }
void insert(int x, int v)
{
    for (int i = x; i <= N; i += lowbit(i))
    {
        s[i] += v;
    }
}
int sum(int x)
{
    int ret = 0;
    for (int i = x; i > 0; i -= lowbit(i))
        ret += s[i];
    return ret;
}

int main()
{
    int n, m;
    int T;
    int x;
    RI(T);
    while (T--)
    {
        RII(n, m);
        N = n + M;
        CLR(s, 0);
        FE(i, 1, n)
        {
            insert(i + M, 1);
            id[i] = i + M;
        }
        pos = M - 1;
        while (m--)
        {
            RI(x);
            printf("%d", sum(id[x]) - 1);
            insert(pos, 1);
            insert(id[x], -1);
            id[x] = pos;
            pos--;
            if (!m) printf("\n");
            else printf(" ");
        }
    }
    return 0;
}

//线段树，暴力更新，可能会降到n*log(n)，给的16s，还是ac了
#include <cstdio>
#include <ctime>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <string>
#include <set>
#include <stack>
#include <map>
#include <cmath>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bitset>
using namespace std;

//LOOP
#define FE(i, a, b) for(int i = (a); i <= (b); ++i)
#define FED(i, b, a) for(int i = (b); i>= (a); --i)
#define REP(i, N) for(int i = 0; i < (N); ++i)
#define CLR(A,value) memset(A,value,sizeof(A))
//INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RS(s) scanf("%s", s)
typedef long long LL;
const int INF = 1000000000;
const int MOD = 1000000007;
const double eps = 1e-10;
const int MAXN = 100100;

#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
int smin[MAXN << 2], smax[MAXN << 2];
int ad[MAXN << 2];

void pushup(int rt)
{
    smin[rt] = min(smin[rt << 1], smin[rt << 1 | 1]);
    smax[rt] = max(smax[rt << 1], smax[rt << 1 | 1]);
}
void pushdown(int rt)
{
    if (ad[rt])
    {
        smin[rt << 1] += ad[rt];
        smin[rt << 1 | 1] += ad[rt];
        smax[rt << 1] += ad[rt];
        smax[rt << 1 | 1] += ad[rt];

        ad[rt << 1] += ad[rt];
        ad[rt << 1 | 1] += ad[rt];

        ad[rt] = 0;
    }
}
void build(int l, int r, int rt)
{
    ad[rt] = 0;
    if (l == r)
    {
        smin[rt] = smax[rt] = l;
        return ;
    }
    int m = (l + r) >> 1;
    build(lson);
    build(rson);
    pushup(rt);
}
void update_p(int p, int l, int r, int rt)
{
    if (l == r)
    {
        smin[rt] = smax[rt] = 1;
        return;
    }
    pushdown(rt);
    int m = (l + r) >> 1;
    if (p <= m) update_p(p, lson);
    else update_p(p, rson);
    pushup(rt);
}
void update_R(int R, int l, int r, int rt)
{
    if (smax[rt] < R)
    {
        smin[rt]++;
        smax[rt]++;
        ad[rt]++;
        return ;
    }
    pushdown(rt);
    int m = (l + r) >> 1;
    if (smin[rt << 1] < R) update_R(R, lson);
    if (smin[rt << 1 | 1] < R) update_R(R, rson);
    pushup(rt);
}
int query(int p, int l,int r,int rt)
{
    if (l == r) return smin[rt];
    pushdown(rt);
    int m = (l + r) >> 1;
    if (p <= m) return query(p, lson);
    else return query(p, rson);
}

int a[MAXN];
int main()
{
    int T;
    int x;
    RI(T);
    int n, m;
    while (T--)
    {
        RII(n, m);
        build(1, n, 1);

        FE(i, 1, m) RI(a[i]);

        FE(i, 1, m)
        {
            if (i != 1)
            printf(" ");
            x = query(a[i], 1, n, 1);
            printf("%d", x - 1);
            update_R(x, 1, n, 1);
            update_p(a[i], 1, n, 1);
        }
        printf("\n");

    }

    return 0;
}