| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | -is-this-fft- | 148 |
| 5 | atcoder_official | 148 |
| 5 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 9 | TheScrasse | 144 |
recursion or loops for DP?
Hey!
I thought that solving DP problems is easier using recursion until I saw this video by Errichto where he said something like using loops is easier and more efficient for hard problems. I find it impossible to solve DP problem not using recursion. So is it really easy and I need to practice more or he said that because he is top tier coder and everything for him is easy xDxD??
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
3l173_5l4y3r | 2019-09-24 18:09:45 | 4 | ||
| en1 |
|
3l173_5l4y3r | 2019-09-24 18:08:11 | 479 | Initial revision (published) |
