Блог пользователя zarif_2002

Автор zarif_2002, история, 5 лет назад, По-английски

1181D - Irrigation I have really a little idea about time complexity but I think this one of mine works in O(n logn). But, it is getting tle. Please help me to avoid the tle and make me understand why I got tle. sorry for my poor english.

55677921

  • Проголосовать: нравится
  • -11
  • Проголосовать: не нравится

»
5 лет назад, # |
Rev. 2   Проголосовать: нравится +14 Проголосовать: не нравится

Do you honestly think that people are going to spend time to read your code when all you provide is a bunch of unreadable code with no explanation of your logic at all?