【模拟赛】【莫队】2021.8.24.B

题目描述

给出长为n的序列A，有m此询问，每次询问求$[l,r]$区间内大小在$[a,b]$以内不同的数的个数

思路

想到莫队后就不知道怎么做了…
莫队然后用树状数组维护就好了

代码

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define re register
#define ll long long
using namespace std;

struct wh_
{
	int l, r, x, y, id, ans;
}q[1000250];

int pos[100250], C[100250], A[100250], B[100250];
int n, m, nn, ans;

bool nW(wh_ i, wh_ j)
{
	if(pos[i.l] == pos[j.l])
		return i.r < j.r;
	else return i.l < j.l;
}

bool nM(wh_ i, wh_ j)
{return i.id < j.id;}

inline int read()
{
	int l = 0, r = 1; char c = getchar();
	while(c < '0' || '9' < c){if(c == '-')r = -1; c = getchar();}
	while('0' <= c && c <= '9')l = l * 10 + c - 48, c = getchar();
	return l * r;
}

inline void write(int k)
{if(k > 9)write(k / 10);putchar(k % 10 + '0');}

inline void add(int x, int k)
{for(; x <= n; x += x & (-x))B[x] += k;}

inline int sum(int x)
{
	int k = 0;
	for(; x; x -= x & (-x))
		k += B[x];
	return k;
}

inline void oper(int k, int t)
{
	if(!C[A[k]])add(A[k], 1);
	C[A[k]] += t;
	if(!C[A[k]])add(A[k], -1);
}

inline void init()
{
	ans = 0;
	int l = 1, r = 0;
	for(int i = 1; i <= m; ++i)
	{
		while(l < q[i].l)oper(l, -1), l++;
		while(l > q[i].l)oper(l - 1, 1), l--;
		while(r < q[i].r)oper(r + 1, 1), r++;
		while(r > q[i].r)oper(r, -1), r--;
		q[i].ans = sum(q[i].y) - sum(q[i].x - 1);//前缀和找区间和
	}
	return;
}

int main()
{
	n = read(), m = read();
	int nn = (int)sqrt(n);
	for(re int i = 1; i <= n; ++i)
	{
		A[i] = read();
		pos[i] = (i - 1) / nn + 1;
	}
	for(re int i = 1; i <= m; ++i)
	{
		q[i].l = read(), q[i].r = read();
		q[i].x = read(), q[i].y = read();
		q[i].id = i;
	}
	sort(q + 1, q + m + 1, nW);
	init();
	sort(q + 1, q + m + 1, nM);
	for(re int i = 1; i <= m; ++i)
		write(q[i].ans), putchar('\n');
	return 0;
}