XOR key 51Nod - 1295 [可持久化trie]

分析：

像主席树那样可持久化

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;//三年竞赛一场空，不开long long见祖宗 
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
const ll mod = 1e9 + 7;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;
int v[maxn], t[maxn * 32][2];
int root[maxn], siz[maxn * 32];
int tot;

void insert(int tar, int val)
{
    root[tar] = ++tot;
    int now = root[tar], pre = root[tar - 1];
    for(int i = 30; i >= 0; i--)
    {
        int bit = val >> i & 1;
        t[now][!bit] = t[pre][!bit], t[now][bit] = ++tot;
        now = t[now][bit], pre = t[pre][bit];
        siz[now] = siz[pre] + 1;
    }
}

int query(int l, int r, int val)
{
    int pre = root[l], now = root[r], res = 0;
    for(int i = 30; i >= 0; i--)
    {
        int bit = val >> i & 1;
        res <<= 1;
        int dif = siz[t[now][!bit]] - siz[t[pre][!bit]];
        if(dif) now = t[now][!bit], pre = t[pre][!bit], res += 1;
        else now = t[now][bit], pre = t[pre][bit];
    }
    return res;
}

int main()
{
    int n, q; cin >> n >> q;
    for(int i = 1; i <= n; i++) cin >> v[i], insert(i, v[i]);
    
    for(int i = 1; i <= q; i++)
    {
        int x, l, r; cin >> x >> l >> r;
        l++, r++;
        cout << query(l - 1, r, x) << endl;
    }
}