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!
[Help] Divide an array into two subsequences such that the xor of their ors is maximum
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!
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
cyber_simar | 2024-07-19 14:42:37 | 37 | ||
| en1 |
|
cyber_simar | 2024-07-19 14:05:19 | 334 | Initial revision (published) |
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
