BZOJ4269: 再见Xor(线性基)

// luogu-judger-enable-o2
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN = 1e5 + 10,  B = 31;
inline int read() {
    char c = getchar(); int x = 0, f = 1;
    while(c < '0' || c > '9') {if(c == '-') f = -1; c = getchar();}
    while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}
int N, P[MAXN];
void Insert(int x) {
    for(int i = B; i >= 0; i--) {
        if(x >> i) {
            if(P[i]) x = x ^ P[i];
            else {P[i] = x; return ;}
        }
    }
}
int QueryMax() {
    int ans = 0;
    for(int i = B; i >= 0; i--)
        if((ans ^ P[i]) > ans)
            ans = ans ^ P[i];
    return ans;
}
int QueryMin() {
    for(int i = 0; i <= B; i++)
        if(P[i]) 
            return P[i];
}
main() { 
#ifdef WIN32
    freopen("a.in", "r", stdin);
#endif
    N = read();
    for(int i = 1; i <= N; i++) {
        Insert(read());
    }
    int Mx = QueryMax(), Mn = QueryMin();
    printf("%d %d", Mx, Mx ^ Mn);
}