[Help] Divide an array into two subsequences such that the sumxor of their xor sums is maximum
Difference between en1 and en2, changed 37 character(s)
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 _**xor_sum(X) + xor_sumOR(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)