How to implement Longest non-decreasing subsequence using recursion+memoization method efficiently? Will be grateful if anyone can help. Thank You.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
How to implement Longest non-decreasing subsequence using recursion+memoization method efficiently? Will be grateful if anyone can help. Thank You.
Name |
---|
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