ilovehitagi's blog

By ilovehitagi, history, 3 years ago, In English

Editorial hinted that there is a $$$O(n^2.log(n))$$$ solution so I tried to implement so using BIT. Turns out I'm still getting TLE, in fact its even slower than the $$$O(n^3)$$$ for some reason.

Code

Full text and comments »

  • Vote: I like it
  • +6
  • Vote: I do not like it