Пожалуйста, подпишитесь на официальный канал Codeforces в Telegram по ссылке https://t.me/codeforces_official. ×

An Interesting POJ Problem — 2828 Buy Tickets

Правка en1, от ILovePlumCakeAndIceCream, 2017-02-05 20:45:24

Hi everyone,Here is the link to the problem here .I got the general O(n*n) approach but It will TLE obviously .When I googled the problem,I got Chinese editorials regarding the same and they all pointed to involvement of segment trees.I could not get much details due to lack of clearity in the English text produced by the Translator .Can someone please help me regarding the same .Thanks and have a nice day :)

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский ILovePlumCakeAndIceCream 2017-02-05 20:45:24 491 Initial revision (published)