unt311's blog

By unt311, history, 2 weeks ago, In English

This is a very cool problem with a short simple problem statement. I am getting TLE for a O(n * (logn)^2) solution.

Please provide a solution, or give suggestions to improve my solution (using binary search and segment tree)

 
 
 
 
  • Vote: I like it
  • -21
  • Vote: I do not like it

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

Auto comment: topic has been updated by unt311 (previous revision, new revision, compare).