How to implement Longest non-decreasing subsequence using recursion+memoization method efficiently? Will be grateful if anyone can help. Thank You.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
How to implement Longest non-decreasing subsequence using recursion+memoization method efficiently? Will be grateful if anyone can help. Thank You.
Название |
---|
Here is a better approach Link
Define function F(id) — "longest non-decreasing subsequence that ends at position id".
Recurrence formula : $$$ F(id) = max(F(id) , F(k) + 1) , 0 <= k < id,value[id] >= value[k]$$$
$$$Answer = max(F(i)), 0 <= i < n$$$ — where n is the number of elements.
IDEA: Find the longest non-decreasing subsequence ending at each position. Now the longest subsequence ends at some position i, so all we need is to find the position such that length of non-decreasing subsequence ending at that position is maximum.
CODE