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].
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
5 | atcoder_official | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
Need help in a dp problem!
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].
Название |
---|