BZOJ2741分块+字典树

<span style="font-size:18px;">分块+字典树走起</span>

<span style="font-size:18px;">F[i][j]表示在第i，j个块间选l,r的答案</span>

<span style="font-size:18px;">A[j][i]表示第j个单点到第i个块的答案</span>

<span style="font-size:18px;">两边的散点暴力合并加入字典树统计答案</span>

<span style="font-size:18px;">注意数组的定义：明确数组的内涵</span>

<span style="font-size:18px;">
</span>

<span style="font-size:18px;">#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>

#define N 12050
#define sizTrie 12050
#define sqrtN 500
#define dm 30

#define li (i-1)*kuai + 1
#define ri min(i*kuai,n)
#define top (n-1)/kuai + 1

using namespace std;

int son[sizTrie][2],cnt;
int n,m,kuai,t[N],IA[N];
int a[N];
int F[sqrtN][sqrtN],A[N][sqrtN];

void reset() {
	//memset(son,0,sizeof(son));
	for (int j=0;j<=cnt;j++) son[j][0] = son[j][1] = 0;
	cnt = 0;
}

void add(int x) {
	int p = 0;
	for (int i=dm;i>=0;i--) {
		int c = (x>>i) & 1;
		if (!son[p][c]) son[p][c] = ++cnt; 
		p = son[p][c];
	}		
}

int query(int x) {
	int p = 0 , tmp = 0;
	for (int i=dm;i>=0;i--) {
		int c = (x>>i) & 1;
		if (son[p][c^1]) {
			tmp += (1<<i);
			p = son[p][c^1];
		} else p = son[p][c];
	}
	return tmp;
}

int main()
{
	//freopen("mxor.in","r",stdin);
	//freopen("mxor.out","w",stdout);
	
	scanf("%d%d",&n,&m);
	
	kuai = sqrt(n);
	for (int i=1;i<=n;i++) t[i] = (i-1) / kuai + 1;
	
	for (int i=1;i<=n;i++) scanf("%d",&IA[i]);
	for (int i=1;i<=n;i++) a[i] = a[i-1] ^ IA[i];
	
	// n * sqrt(n) * log n
	for (int i=1;i<=top;i++) { 
		reset();
		for (int j=li;j<=ri;j++) add(a[j-1]);
		
		for (int j=li;j<=n;j++) {
			int tmp = query(a[j]);
			F[i][t[j]] = max( tmp , F[i][t[j]] );
			A[j][i] = tmp;
		}
		
		reset();
		for (int j=li;j<=ri;j++) add(a[j]);
		for (int j=1;j<=li-1;j++) {
			int tmp = query(a[j-1]);
			A[j][i] = tmp;
			F[i][t[j]] = max(tmp, F[i][ t[j] ]);
		}
			
	}
	
	// n
	for (int k=1;k<=top;k++)
		for (int i=1;i+k<=top;i++) {
			F[i][i+k] = max(F[i+1][i+k],F[i][i+k]);
			F[i][i+k] = max(F[i][i+k-1],F[i][i+k]);
		}
		
	int ans = 0;
	
	//m * n
	while (m--) {
		int l,r;
		scanf("%d%d",&l,&r);
		l = (1LL * l + ans) % n + 1;
	    r = (1LL * r + ans) % n + 1;
		if (l > r) swap(l,r);
		
		ans = 0;
		if (t[l] == t[r]) {
			reset();
			for (int j=l;j<=r;j++) add(a[j-1]);
			for (int j=l;j<=r;j++) ans = max(query(a[j]) , ans);
		} else {
			if (t[l]+1 <= t[r]-1) ans = F[ t[l]+1 ][ t[r]-1 ];
			
			reset();
			
			int i = t[l];
			for (int j=l;j<=ri;j++) add(a[j-1]);
			
			i = t[r];
			for (int j=li;j<=r;j++) add(a[j-1]);
			
			i = t[l];
			for (int j=l;j<=ri;j++) ans = max(query(a[j]),ans);
			
			i = t[r];
			for (int j=li;j<=r;j++) ans = max(query(a[j]),ans);
			
			i = t[l];
			for (int j=l;j<=ri;j++) 
				for (int k=t[l]+1;k<=t[r]-1;k++)
					ans = max(A[j][k] , ans);
			
			i = t[r];
			for (int j=li;j<=r;j++)
				for (int k=t[l]+1;k<=t[r]-1;k++)
					ans = max(A[j][k] , ans);
		}
		printf("%d\n",ans);
	}
	//fclose(stdin);fclose(stdout);
	return 0;
}</span>