Frontier_Setter的博客

http://train.usaco.org/usacoprob2?a=Hfv8bxVT1Ac&S=cowxor题目大意：一串N个数（可能有相同），求出异或最大的序列，有相同解则取结尾靠前的，再相同则取短的字典树，在字典树里标记位置/* ID: frontie1 TASK: cowxor LANG: C++ */ #include <iostream> #include &lt...

https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/ Given anon-emptyarray of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai< 231. Find the maximum result of aiXOR aj, where 0 ...