Maximum XOR subsequence

Правка en1, от force_awakens, 2017-06-16 12:40:07

We can solve the maximum (AND) subsequence of an array by checking the common bits in numbers in O(nlogn).But how can we find a susequence with maximum XOR?

Теги xor, bit manipulation, #math

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский force_awakens 2017-06-16 12:40:07 179 Initial revision (published)