injxshn's blog

By injxshn, history, 4 weeks ago, In English

First register for the contest here.

A. MaxOr Subarray

Idea: injxshn
Editorial: tch1cherin

Tutorial
Solution
  • Vote: I like it
  • +73
  • Vote: I do not like it

»
4 weeks ago, # |
  Vote: I like it +21 Vote: I do not like it

I cant understand, why there downvotes? Guy created testcases, full editorial, statements. I do not have experience in creating problems, but even for me its clear, that it very difficult.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

How did you upload the problem to codeforces?

»
4 weeks ago, # |
  Vote: I like it +3 Vote: I do not like it

Problem is okay, but author's solution in $$$O(n+q)$$$ is cute. Also you can solve same problem with updates in $$$O(nlogn*logmaxA)$$$.

»
4 weeks ago, # |
Rev. 3   Vote: I like it 0 Vote: I do not like it

Good problem! Overcomplicated the problem... solved it using binary search on sparse table with time complexity $$$O(n\log n+q\log n\log n)$$$ >_<