Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

Need help in a dp problem!

Revision en1, by iamskp, 2020-09-23 21:31:06

Given an array, find out the longest increasing subsequence which is lexicographically smallest.

For example:

Given array : [9,2,10,3,11,4]

Possible LIS: [2,10,11],[2,3,4],[9,10,11],[2,3,11]

Lexicographically smallest LIS [2,3,4].


  Rev. Lang. By When Δ Comment
en1 English iamskp 2020-09-23 21:31:06 270 Initial revision (published)