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!
↵
Any help would be appreciated. Thanks!