Lexographically LIS of a fixed length.

Правка en1, от S_Neal, 2024-05-08 21:23:05

How to find the lexographically smallest Longest Increasing Subsequence of a fixed length k.where size of the array is 100000 and 1<=k<=100000.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский S_Neal 2024-05-08 21:23:05 181 Initial revision (published)