题解
从这个数列里面取出一些数,异或最大,求他们的异或值。
思路
显然要求异或最大我们首先要把这些数表示成二进制形式,然后从高到低按位查找,如果这一位存在一个数是1就取这个数,然后异或之后这一位就是1了。取了这个数之后这个数的低位自然也要取,所以我们用高斯消元回代的形式来维护当前位的异或值。
代码
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define LL long long
#define Lowbit(x) ((x)&(-x))
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1|1
#define MP(a, b) make_pair(a, b)
const int INF = 0x3f3f3f3f;
const int MOD = 1000000007;
const int maxn = 1e5 + 7;
const double eps = 1e-8;
const double PI = acos(-1.0);
int n;
bool vis[110];
int a[110][110];
LL gauss()
{
int k, col;
LL ans = 0;
memset(vis, 0, sizeof(vis));
for (k = 63; k >= 0; k--)
{
ans <<= 1;
for (col = 0; col < n; col++)
if (a[k][col] && !vis[col])
{
vis[col] = 1;
ans |= 1;
break;
}
if (col == n)
{
if (a[k][n] == 0)
ans |= 1;
}
else
{
for (int i = k - 1; i >= 0; i--)
if (a[i][col])
for (int j = 0; j <= n; j++)
a[i][j] ^= a[k][j];
}
}
return ans;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
while (scanf("%d", &n) != EOF)
{
for (int i = 0; i < n; i++)
{
LL x;
scanf("%lld", &x);
int k = 0;
while (x)
{
a[k++][i] = x % 2;
x /= 2;
}
}
for (int i = 0; i <= 63; i++)
a[i][n] = 1;
printf("%lld\n", gauss());
}
return 0;
}