莫队（sample

思想

核心思想就是通过分块算法来减少时间复杂度，从O(n^2)优化到O(nsqrt(n) )，可以解决区间求不同问题

思维过程

从暴力扫到双指针，动态搜索总是会卡时间复杂度，所以我们为了能尽可能地用上之前的数据，我们选择离线计算后按顺序输出

模板

加了巨多优化（其中还有许多佛系优化）

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define maxn 1010000
#define maxb 1010
using namespace std;
int aa[maxn], cnt[maxn], belong[maxn];
int n, m, size, bnum, now, ans[maxn];
struct query 
{
	int l, r, id;
};
query q[maxn];
int cmp(query a, query b) 
{
	return (belong[a.l] ^ belong[b.l]) ? belong[a.l] < belong[b.l] : ((belong[a.l] & 1) ? a.r < b.r : a.r > b.r);
}
int read() {
	int res = 0;
	char c = getchar();
	while(!isdigit(c)) c = getchar();
	while(isdigit(c)) res = (res << 1) + (res << 3) + c - 48, c = getchar();
	return res;
}
inline void write(int x){
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
int main()
{
	scanf("%d", &n);
	size = sqrt(n);
	bnum = ceil((double)n / size);
	for(int i = 1; i <= bnum; ++i) 
		for(int j = (i - 1) * size + 1; j <= i * size; ++j)
			belong[j] = i;
	for(int i = 1; i <= n; ++i) 
		aa[i] = read(); 
	m = read();
	for(int i = 1; i <= m; ++i)
	{
		q[i].l = read(), q[i].r = read();
		q[i].id = i;
	}
	sort(q + 1, q + m + 1, cmp);
	int l = 1, r = 0;
	for(int i = 1; i <= m; ++i)
	{
		int ql = q[i].l;
		int qr = q[i].r;
		while(l < ql) 
			now -= !--cnt[aa[l++]];
		while(l > ql) 
			now += !cnt[aa[--l]]++;
		while(r < qr) 
			now += !cnt[aa[++r]]++;
		while(r > qr) 
			now -= !--cnt[aa[r--]];
		ans[q[i].id] = now;
	}
	for(int i = 1; i <= m; ++i)
	{
		write(ans[i]);
		putchar('\n');
	}
		
	return 0;
}