[Trie树]B. 【例题2】最大异或对

解析

这道题是\(Trie\)树, 要求异或的值最大, 就尽可能找不同的

code

#include <bits/stdc++.h>
#define N 10000005
using namespace std;

int a[N][2];
int n, tag = 1, ans;

void fd (int t)
{
	int now = 1, s = 0;
	for (int i = 31; i >= 0; -- i)
	{
		int c = !((t >> i) & 1);
		if (a[now][c]) s += (1 << i);
		else c = !c;
		now = a[now][c];
	}
	ans = max (ans, s);
}

void in (int t)
{
	int now = 1;
	for (int i = 31; i >= 0; -- i)
	{
		int c = ((t >> i) & 1);
		if (!a[now][c]) a[now][c] = ++ tag;
		now = a[now][c];
	}
}

int main ()
{
	scanf ("%d", &n);
	for (int i = 1; i <= n; ++ i)
	{
		int t;
		scanf ("%d", &t);
		in (t);
		fd (t);
	} 
	printf ("%d", ans);
	return 0;
} 

[Trie树]B. 【例题2】最大异或对

原文：https://www.cnblogs.com/unknown-future/p/14876584.html