TLE on 448C ?

Правка en1, от karishma_gupta, 2020-10-24 13:47:30

https://codeforces.com/contest/448/submission/96518240 I think the complexity is O(n^2) and so, I can't figure out as to why does it TLE? I have been trying to debug it and optimize it for hours. Any help would be appreciated.

Теги #dp, divide and conquer, #greedy

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский karishma_gupta 2020-10-24 13:47:30 239 Initial revision (published)