Can be a rule there to transform the Top-Down
to Bottom-Up
?
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | Petr | 145 |
9 | pajenegod | 145 |
Can be a rule there to transform the Top-Down
to Bottom-Up
?
Название |
---|
?????
You need to be more specific to get a definitive answer.
Generally though, dynamic programming is essentially traversing a directed graph of states (vertices) and dependencies between them (arcs). It depends on the problem whether it is feasible to, looking at a certain state, list all incoming edges, or all outgoing edges, or both.
I think I understand him, I think he needs some tips to transform Top-Down recursive with memoization dynamic programming to Bottom-Up with loops!