Lately I have been having a hard time to identify and apply binary search on problems. So it there any playlist to prepare for binary search?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 161 |
1 | cry | 161 |
3 | maomao90 | 160 |
4 | awoo | 158 |
4 | -is-this-fft- | 158 |
6 | atcoder_official | 157 |
7 | nor | 155 |
7 | adamant | 155 |
9 | maroonrk | 152 |
10 | Dominater069 | 149 |
Lately I have been having a hard time to identify and apply binary search on problems. So it there any playlist to prepare for binary search?
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!
Hello! This code is working fine locally, so I don't know why it's giving me the Exit code is 1 Runtime Error. Can anyone take a look? Thank you. The submission
Name |
---|