题意:
一个非负整数序列,两个操作:
1.添加一个数到序列最后
2.询问l,r,x,要找到在[l,r]之间一个p使得x^a[p]^a[p+1]^..^a[n]最大。
做法:
记s[i]为前缀异或值,则x^a[p]^..^a[n]=x^s[n]^s[p-1];
观察到x^s[n]为定值,所以只需要求[l,r]内和x^s[n]最大的s[p-1]。
用可持久化trie维护。
代码:
/*************************************************************
Problem: bzoj 3261 最大异或和
User: fengyuan
Language: C++
Result: Accepted
Time: 4704 ms
Memory: 226288 kb
Submit_Time: 2017-12-26 15:16:16
*************************************************************/
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
using namespace std;
const int N = 300010, M = 14400010;
int n, m, tot;
char opt[4];
int rt[M], ch[M][2], sum[M];
inline void insert(int pre, int &rt, int x, int d)
{
rt = ++ tot; sum[rt] = sum[pre] + 1;
if(d < 0) return;
int p = x>>d&1;
ch[rt][p^1] = ch[pre][p^1];
insert(ch[pre][p], ch[rt][p], x, d-1);
}
inline int query(int u, int v, int x, int d)
{
if(d < 0) return 0;
int p = x>>d&1; int s = sum[ch[v][p^1]] - sum[ch[u][p^1]];
if(s > 0) return (1<<d) + query(ch[u][p^1], ch[v][p^1], x, d-1);
else return query(ch[u][p], ch[v][p], x, d-1);
}
int main()
{
scanf("%d%d", &n, &m);
insert(rt[0], rt[1], 0, 24);
int all = 0;
for(int i = 1; i <= n; i ++) {
int x; scanf("%d", &x); all ^= x;
insert(rt[i], rt[i+1], all, 24);
} n ++;
while(m --) {
scanf("%s", opt);
if(opt[0] == 'A') {
int x; scanf("%d", &x); all ^= x;
insert(rt[n], rt[n+1], all, 24); n ++;
} else {
int x, y, z; scanf("%d%d%d", &x, &y, &z);
printf("%d\n", query(rt[x-1], rt[y], all^z, 24));
}
}
return 0;
}