| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3947 |
| 2 | jiangly | 3740 |
| 3 | Radewoosh | 3652 |
| 4 | Benq | 3626 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | ecnerwala | 3587 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | ksun48 | 3485 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 163 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | atcoder_official | 155 |
| 5 | nor | 154 |
| 6 | cry | 153 |
| 7 | maroonrk | 152 |
| 8 | -is-this-fft- | 151 |
| 9 | SecondThread | 148 |
| 10 | Petr | 146 |
I find that finding the recurrence formula for an advanced dynamic programming problem is quite a difficult problem for me. Maybe I am stuck in a way of thinking.
Hope everyone will help me. And most of all, if possible, please give me some tips and tricks for doing advanced dynamic programming.
Thanks you so much !
Usually, If you find DP pattern, finding recurrence formula isn't that difficult. But anyways, you should have a big experience solving such problems, to not struggle in future.