线性基模板

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int maxn = 50;
const int maxbit = 64;
int n;
ll a[maxn],p[maxbit];
int main(){
    scanf("%d",&n);
    memset(a,0,sizeof a);
    memset(p,0,sizeof p);
    for(int i=1;i<=n;i++){
        scanf("%lld",a+i);
        //构造线性鸡
        for(int j=62;j>=0;j--){
            if(!(a[i]>>j)) continue;
            if(!p[j]){
                p[j] = a[i];
                break;
            }
            a[i] ^= p[j];
        } 
    }
    ll ans = 0;
    for(int i=62;i>=0;i--){
        ans = max(ans,ans^p[i]);
    }
    printf("%lld",ans);
    return 0;
}