NGiveUp's blog

Need Help regarding TLE
By NGiveUp, history, 3 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...

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

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

for (int i = start; i <= end; ++i). This part makes your code n^2

→ Reply