In this question, DIV 2C, Is is possible to solve this using recursive approach without exceeding the memory limit??
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | SecondThread | 145 |
Name |
---|
Auto comment: topic has been updated by skpro19 (previous revision, new revision, compare).
You don't need to convert it. You can use simple memory optimisation in this question because the current state i depends only on the previous state i-1.
So you can use i%2 instead of i and that would save a lot of memory.
Have a look in this code here: Code
The thing is, I always solve dp problems recursively, so i was wondering will it be possible to solve it in a recursive fashion without exceeding the memory limit? I do understand the bottom up approach though.