Longest Increasing Subsequence

Правка en1, от n8118, 2015-07-19 22:45:58

Can some one explain LIS, a O(nlog(n)) solution clearly as i couldn't find more resources to learn clearly on internet

Теги dynamic programming, arithmetic sequence, help, competitive programming

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский n8118 2015-07-19 22:45:58 148 Initial revision (published)