P1972 [SDOI2009] BIT / 主席树

题意

传送门 P1972 [SDOI2009]HH的项链

题解

BIT

对于相同 $r$ 的查询，不同的 $a_i$ 只关注最靠右的位置 $k$，若 $l$ 在 $k$ 的右侧，$a_i$ 贡献为 $0$，反之为 $1$。将查询按 $r$ 升序排序，从左向右扫描，设 $pre$ 代表 $a_i$ 上一次出现的位置，则每次操作为 $add(pre[a_i],-1),add(i,1)$，答案为 $sum(r)-sum(l-1)$。时间复杂度 $O(N\log N)$。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
struct node
{
    int l, r, k;
    bool operator<(const node &b) const { return r < b.r; }
} Q[maxn];
int N, M, A[maxn], pre[maxn], bit[maxn], res[maxn];

inline int read()
{
    int x = 0;
    char c = 0;
    for (; c < '0' || c > '9'; c = getchar())
        ;
    for (; c >= '0' && c <= '9'; c = getchar())
        x = (x << 1) + (x << 3) + c - '0';
    return x;
}

inline void write(int x)
{
    if (!x)
    {
        puts("0");
        return;
    }
    int k = 0, t[10];
    while (x)
        t[++k] = x % 10, x /= 10;
    while (k)
        putchar(t[k--] + '0');
}

void add(int i, int x)
{
    while (i <= N)
        bit[i] += x, i += i & -i;
}

int sum(int i)
{
    int s = 0;
    while (i)
        s += bit[i], i -= i & -i;
    return s;
}

int main()
{
    N = read();
    for (int i = 1; i <= N; ++i)
        A[i] = read();
    M = read();
    for (int i = 1; i <= M; ++i)
        Q[i].l = read(), Q[i].r = read(), Q[i].k = i;
    sort(Q + 1, Q + M + 1);
    for (int i = 1, p = 1, ql, qr; i <= M; ++i)
    {
        ql = Q[i].l, qr = Q[i].r;
        for (int j = p; j <= qr; ++j)
        {
            if (pre[A[j]])
                add(pre[A[j]], -1);
            add(j, 1), pre[A[j]] = j;
        }
        p = qr + 1;
        res[Q[i].k] = sum(qr) - sum(ql - 1);
    }
    for (int i = 1; i <= M; ++i)
        write(res[i]), putchar('\n');
    return 0;
}

主席树

若查询区间存在 $a_i$，设 $a_i$ 上一次出现的位置为 $pre[a_i]$，那么存在且仅存在一个位置 $k\in [l,r]$ 满足 $pre[a_k]<l,a_k=a_i$。答案为 $\sum _{i=l}^r[pre[a_i]<l]$，主席树维护即可。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005, maxlg = 21;
struct node
{
#define ls(x) tree[x].ls
#define rs(x) tree[x].rs
#define sum(x) tree[x].sum
    int ls, rs, sum;
} tree[maxn * maxlg];
int N, M, tot, pre[maxn], rt[maxn];

inline int read()
{
    int x = 0;
    char c = 0;
    for (; c < '0' || c > '9'; c = getchar())
        ;
    for (; c >= '0' && c <= '9'; c = getchar())
        x = (x << 1) + (x << 3) + c - '0';
    return x;
}

inline void write(int x)
{
    if (!x)
    {
        puts("0");
        return;
    }
    int k = 0, t[10];
    while (x)
        t[++k] = x % 10, x /= 10;
    while (k)
        putchar(t[k--] + '0');
}

void insert(int &p, int q, int x, int l, int r)
{
    if (!p)
        p = ++tot;
    sum(p) = sum(q) + 1;
    if (r - l == 1)
        return;
    int m = (l + r) >> 1;
    x < m ? (rs(p) = rs(q), insert(ls(p), ls(q), x, l, m)) : (ls(p) = ls(q), insert(rs(p), rs(q), x, m, r));
}

int ask(int p, int q, int a, int b, int l, int r)
{
    if (r <= a || b <= l)
        return 0;
    if (a <= l && r <= b)
        return sum(p) - sum(q);
    int m = (l + r) >> 1;
    return ask(ls(p), ls(q), a, b, l, m) + ask(rs(p), rs(q), a, b, m, r);
}

int main()
{
    N = read();
    for (register int i = 1, a; i <= N; ++i)
    {
        a = read();
        insert(rt[i], rt[i - 1], pre[a], 0, N + 1);
        pre[a] = i;
    }
    M = read();
    for (register int i = 1, l, r; i <= M; ++i)
    {
        l = read(), r = read();
        write(ask(rt[r], rt[l - 1], 0, l, 0, N + 1)), putchar('\n');
    }
    return 0;
}