P1972 [SDOI2009] HH的项链https://www.luogu.com.cn/problem/P1972首先来分析区间的种类,例如一个区间内有 2 1 3 4 1这几种贝壳,很明显种类为1的贝壳有两个,那么我们可以认为只算最后一个,也就是最靠右边的那个贝壳,于是我们可以维护一个nex数组来记录该种类最后出现的位置,然后计算区间种类即可,我们离线的解决该问题,将询问区间的右端点排序,又因为单点修改,区间查询这一特性我们考虑树状数组,每次进入下一区间的时候更新nex数组,并把之前改种类贝壳出现的位置之前的前缀和-1再将目前前缀和+1.
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))
struct node {
int l, r, id;
bool operator <(const node &b)const {
return r < b.r;
}
} q[MAXN];
int s[MAXN];
int tree[MAXN];
int nex[MAXN];
int ans[MAXN];
int n;
inline void update(int pos, int x) {
for (; pos <= n; pos += lowbit(pos)) {
tree[pos] += x;
}
}
int query(int num) {
int rec = 0;
for (; num; num -= lowbit(num)) {
rec += tree[num];
}
return rec;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", s + i);
}
int m;
scanf("%d", &m);
for (int i = 1; i <= m; i++) {
scanf("%d %d", &q[i].l, &q[i].r);
q[i].id = i;
}
sort(q + 1, q + m + 1);
int pow = 1;
for (int i = 1; i <= m; i++) {
for (int j = pow; j <= q[i].r; j++) {
if (nex[s[j]]) {
update(nex[s[j]], -1);
}
update(j, 1);
nex[s[j]] = j;
}
pow = q[i].r + 1;
ans[q[i].id] = query(q[i].r) - query(q[i].l - 1);
}
for (int i = 1; i <= m; i++) {
printf("%d\n", ans[i]);
}
return 0;
}