D

A_yixiubro · 2024-12-03 15:55:08 · 个人记录

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M=63;
ll p[M];
bool zero;
void Insert(ll x){
    for (int i=M;i>=0;i--){
        if (x>>i==1){
            if (p[i]==0){
                p[i]=x;
                return ;
            }
            else
            x^=p[i];
        } 
    }
    zero=1;
}
ll qmax(){
    ll ans=0;
    for (int i=M;i>=0;i--)
    ans=max(ans,ans^p[i]);
    return ans;
}
int main(){
    ll x;
    int n;
    cin>>n;
    for (int i=1;i<=n;i++)
    cin>>x,Insert(x);
    cout<<qmax();
    return 0;
}