SPOJ - DQUERY:D-query 主席树

传送门

题意

给定一个数组$a[n]$，请你统计$l$到$r$中不同数字的个数。

分析

跟上一题一样，同样用主席树维护
第$i$棵主席树表示区间内$[1-r]$不同数的个数，然后维护$last$，对于每个位置，先将上一个位置减一，再将当前位置加一即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10,M = 1e6 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
struct Node{
    int l,r;
    int cnt;
}tr[N * 50];
int a[N],la[M];
int n,m;
int root[N],idx;

int build(int l,int r){
    int p = ++idx;
    if(l == r) return p;
    int mid = l + r >> 1;
    tr[p].l = build(l,mid),tr[p].r = build(mid + 1,r);
    return p;
}

int insert(int p,int l,int r,int x,int val){
    int q = ++idx;
    tr[q] = tr[p];
    if(l == r) {
        tr[q].cnt += val;
        return q;
    }
    int mid = l + r >> 1;
    if(x <= mid) tr[q].l = insert(tr[q].l,l,mid,x,val);
    else tr[q].r = insert(tr[q].r,mid + 1,r,x,val);
    tr[q].cnt = tr[tr[q].l].cnt + tr[tr[q].r].cnt;
    return q;
}

int query(int p,int l,int r,int x){
    if(l == r) return tr[p].cnt;
    int mid = l + r >> 1;
    int sum = 0;
    if(x <= mid) sum = tr[tr[p].r].cnt + query(tr[p].l,l,mid,x);
    else sum = query(tr[p].r,mid + 1,r,x);
    return sum;
}

int main() {
    read(n);
    root[0] = build(1,n);
    for(int i = 1;i <= n;i++) read(a[i]);
    for(int i = 1;i <= n;i++){
        if(!la[a[i]]) root[i] = insert(root[i - 1],1,n,i,1);
        else{
            root[i] = insert(root[i - 1],1,n,la[a[i]],-1);
            root[i] = insert(root[i],1,n,i,1);
        }
        la[a[i]] = i;
    }
    read(m);
    while(m--){
        int l,r;
        read(l),read(r);
        di(query(root[r],1,n,l));
    }
    return 0;
}