最大异或和(trie)

3485. 最大异或和 - AcWing题库

#include <bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#define x first
#define int long long
#define y second
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
typedef pair<char,int> PCI;
typedef pair<LL,LL> PLL;
//typedef __int128 i128;
typedef unsigned long long ULL;
const int N=1e5+10,INF = 1e9 ,mod = 1e9 + 7 ;
const double eps = 1e-7;


int n,a[N],son[N * 31 ][2],idx;
int cnt[N * 31 ],s[N],m;
void in(int x,int v)
{
    int p= 0;
    for(int i=30;i >= 0; i-- )
    {
        int u = x >> i & 1;
        int &t = son[p][u];
        if(!t) t = ++ idx;
        p = t;
        cnt[p] += v;
    }
    
}

int query(int x)
{
    int p=0,res=0;
    for(int i=30;i>=0; i-- )
    {
        int u = x >> i & 1;
        int &t1= son[p][!u],&t2 =son[p][u];
        if(cnt[t1]) p= t1,res += 1 << i;
        else p = t2;
        
    }
    
    return res;
}


void solve()
{
    cin >> n>> m;
    for(int i=1;i<=n;i ++ )
    {
        int x;cin >> x;
        s[i] = s[i-1] ^ x;
    }
    int res=0;
    in(s[0],1);
    
    for(int i=1;i<=n; i++ )
    {
        if(i > m ) in(s[i-m-1],-1);//将这段区间的上一个数删掉 
        res = max(res,query(s[i]));
        in(s[i],1);
    }
    cout << res<<endl;
    
}


signed main()
{
//    freopen("1.txt","r",stdin);
    ios
    LL T=1;
//    cin>>T;
    while(T -- )
    {
        solve();
    }



    return 0;
}