Can this be done in O(n^2) space and O(n^3) time? Please share your approach.
# | 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 |
Doubt in DP states
Can this be done in O(n^2) space and O(n^3) time? Please share your approach.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | ankeshgupta007 | 2017-10-05 18:07:22 | 0 | (published) | ||
en2 | ankeshgupta007 | 2017-10-05 18:07:07 | 81 | |||
en1 | ankeshgupta007 | 2017-10-05 18:05:56 | 89 | Initial revision (saved to drafts) |
Name |
---|