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_sum(Y).
Any help would be appreciated. Thanks!
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
4 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
8 | Dominater069 | 154 |
8 | nor | 154 |
[Help] Divide an array into two subsequences such that the sum of their xor sums 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 xor_sum(X) + xor_sum(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) |
Name |
---|