[Help] Divide an array into two subsequences such that the xor of their ors is maximum

Revision en2, by cyber_simar, 2024-07-19 14:42:37

Given an array A of length n(n≤105, ai<250), divide it into two subsequences X and Y such that (x1|x2...) ⊕ (y1|y2...) is maximum. Print the maximum OR(X) ⊕ OR(Y).

Any help would be appreciated. Thanks!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English cyber_simar 2024-07-19 14:42:37 37
en1 English cyber_simar 2024-07-19 14:05:19 334 Initial revision (published)