『莫队·分块』 [BZOJ 3809] Gty的二逼妹子序列

题目描述

题解

对于每一个询问分块，每一次都能把所有访问到的点坐上标记。然后把每一个权值分块即可。因此做标记既要做这个权值的标记，也要做权值对应的块的标记。然后就是很简单的分块啦~

代码：

#include <bits/stdc++.h>

using namespace std;
const int N = 2e5, M = 2e6;

int n, m, T;
int a[N], L[N], R[N], bel[N], ans[M], sum[N], vis[N];
struct node {
	int l, r, a, b, bel, id;
} q[M];

bool cmp(node p1,node p2) {
	if (p1.bel == p2.bel) 
		return p1.r < p2.r;
	return p1.bel < p2.bel;
}

void init(void)
{
	scanf("%d %d", &n, &m), T = sqrt(n);
	for (int i=1;i<=n;++i)
		scanf("%d", a+i);
	for (int i=1;i<=m;++i)
	{
		scanf("%d %d", &q[i].l, &q[i].r);
		scanf("%d %d", &q[i].a, &q[i].b);
		q[i].bel = (q[i].l-1)/T, q[i].id = i;
	}
	sort(q+1,q+m+1,cmp);
	return;
}

void prepare(void)
{
	for (int i=1;i<=T;++i)
		L[i] = R[i-1]+1, R[i] = T*i;
	if (R[T] < n) L[++T] = R[T-1]+1, R[T] = n;
	for (int i=1;i<=T;++i)
	    for (int j=L[i];j<=R[i];++j)
	        bel[j] = i;
	return;
}

void ins(int x) 
{	
	vis[x] ++;
	if (vis[x] == 1) sum[bel[x]] ++;
	return;
}

void del(int x)
{
	vis[x] --;
	if (vis[x] == 0) sum[bel[x]] --;
	return;
}

int ask(int l,int r,int ans = 0)
{
	for (int i=1;i<=T;++i)
	{
		if (L[i] > r || R[i] < l) continue;
		if (l <= L[i] && R[i] <= r) ans += sum[i];
		else for (int j=max(l,L[i]);j<=min(R[i],r);++j) 
			ans += (vis[j] > 0);
	}
	return ans;
}

int main(void)
{
	freopen("data.in","r",stdin);
	freopen("data.out","w",stdout);
	init();
	prepare();
	int r = 0, l = 1;
	for (int i=1;i<=m;++i)
	{
		while (l > q[i].l) ins(a[--l]);
		while (r < q[i].r) ins(a[++r]);
		while (l < q[i].l) del(a[l++]);
		while (r > q[i].r) del(a[r--]);
		ans[q[i].id] = ask(q[i].a,q[i].b);
	}
	for (int i=1;i<=m;++i)
		printf("%d\n", ans[i]);
	return 0;
}