【51 nod 1295 XORkey】可持久化字典树

51nod1295
给出一个长度为N的正整数数组A，再给出Q个查询，每个查询包括3个数，L, R, X (L <= R)。求A[L] 至 A[R] 这R - L + 1个数中，与X 进行异或运算(Xor)，得到的最大值是多少？

区间查询记得转换为前缀思想 然后用可持久化数据结构维护前缀和
那么查询区间就可以实现了
从高位往下 那一位和自己那位相反就进行异或

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
//#pragma comment(linker, "/STACK:10240000,10240000")
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
typedef unsigned long long ull;
const ull hash1 = 201326611;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){ll ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
//ull ha[MAX_N],pp[MAX_N];

inline int read()
{
    int date = 0,m = 1; char ch = 0;
    while(ch!='-'&&(ch<'0'|ch>'9'))ch = getchar();
    if(ch=='-'){m = -1; ch = getchar();}
    while(ch>='0' && ch<='9')
    {
        date = date*10+ch-'0';
        ch = getchar();
    }return date*m;
}

/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/

/*int root[MAX_N],cnt,sz;
namespace hjt
{
    #define mid ((l+r)>>1)
    struct node{int l,r,maxx;}T[MAX_N*40];

    #undef mid
}*/
const int MAX_N = 100025;
int idx = 1,arr[MAX_N],root[MAX_N]={1},son[MAX_N*30][2],sze[MAX_N*30];
void Insert(int i,int x)
{
    int now = root[i] = ++idx;
    int old = root[i-1];
    for(int i = 31;i>=0;--i)
    {
        sze[now] = sze[old]+1;
        if((x>>i)&1) son[now][0] = son[old][0],son[now][1] = ++idx;
        else son[now][1] = son[old][1],son[now][0] = ++idx;
        now = son[now][(x>>i)&1];
        old = son[old][(x>>i)&1];
    }
    sze[now] = sze[old]+1;
}
int query(int l,int r,int x)
{
    int old = root[l],now = root[r],ans = 0;
    for(int i = 31;i>=0;--i)
    {
        bool dir = (x>>i)&1;
        int delta_sze = sze[son[now][!dir]] - sze[son[old][!dir]];
        if(delta_sze) now = son[now][!dir],old = son[old][!dir],ans = ans<<1|1;
        else now = son[now][dir],old = son[old][dir],ans = ans<<1;
    }
    return ans;
}
int main()
{
    int n,m,x,l,r;
    scanf("%d%d",&n,&m);
    for(int i = 1;i<=n;++i)
        scanf("%d",&arr[i]),Insert(i,arr[i]);

    while(m--)
    {
        scanf("%d%d%d",&x,&l,&r);
        printf("%d\n",query(l,r+1,x));
    }
    return 0;
}