S_Neal's blog

By S_Neal, history, 8 months ago, In English

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.

Full text and comments »

  • Vote: I like it
  • +8
  • Vote: I do not like it