Codeforces исполнилось 10 лет! Мы рады анонсировать краудфандинг-кампанию. Поздравьте нас по ссылке ×

Help please

Правка en1, от _QWOiNYUIVMPFSBKLiGSMAP_, 2018-01-26 18:25:42

i couldn't understand this problem solution okay i understand that he get the LIS in nlogn twice from both sides preprocess for the length of increasing subsequence till now then he makes a loop and calculate the min of LIS from both sides what i don't understand is how he guaranteed that the LIS max number will be smaller than ith element in the original array.




  Rev. Язык Кто Когда Δ Комментарий
en1 Английский _QWOiNYUIVMPFSBKLiGSMAP_ 2018-01-26 18:25:42 533 Initial revision (published)