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].
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 166 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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].
Name |
---|