[Editorial] Maximum Xor Subarray

cpinitiative / usaco-guide

A free collection of curated, high-quality resources to take you from Bronze to Platinum and beyond.

https://usaco.guide

Other

1.61k stars 483 forks source link

[Editorial] Maximum Xor Subarray #4746

Closed brebenelmihnea closed 4 weeks ago

brebenelmihnea commented 1 month ago

Place an "x" in the corresponding checkbox if it is done or does not apply to this pull request.

[x] I have tested my code.
[x] I have added my solution according to the steps here.
[x] I have followed the code conventions mentioned here.
- I understand that if it is clear that I have not attempted to follow these conventions, my PR will be closed.
- If changes are requested, I will re-request a review after addressing them.
[ ] I have linked this PR to any issues that it closes.

brebenelmihnea commented 1 month ago

https://cses.fi/problemset/result/10389405/

TheGamingMousse commented 1 month ago

i'm gonna trust that justin knows what this explanation is about lmao

yeah i solved this problem yesterday cuz i got bored, altho my impl uses pointers lol

TheGamingMousse commented 1 month ago

$\mathcal{O}(N \cdot \log{MAXVAL})$ isn't the nicest way to notate it - maybe something like $\mathcal{O}(N \cdot \log{C})$, where $C = INT MAX$? idk, that might not be any cleaner tbh

SansPapyrus683 commented 4 weeks ago

no yeah that works like N log M, where M is the maximum value