Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

NGiveUp's blog

By NGiveUp, history, 5 years ago, In English

Hii Guys, i am getting TLE in this Problem. and my solution is this. every D&C i range over small range and divide it so i think time compl is O(nlogn) . but due to TLE i miss some please help me...

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By NGiveUp, history, 5 years ago, In English

Why i m getting TLE for this problem ??? and my solution is this. here preprocessing take O(n) and per query take constant time please help.

Full text and comments »

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