Maximum xor subsequence

Правка en1, от shank_punk, 2015-09-01 15:37:22

Hi guys. I was trying to solve this problem but couldn't arrive with a working solution . We have to find the maximum xor contiguous sub-sequence . I have no idea how to start (I know we have to use trie , but don't know how to can find the max xor contiguous sub-sequence ).

Теги trie, tree

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский shank_punk 2015-09-01 15:37:22 401 Initial revision (published)