Is it good to use unordered map for every dp problem as it could be more memory efficient in comparison to vector in c++
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Is it good to use unordered map for every dp problem as it could be more memory efficient in comparison to vector in c++
https://mirror.codeforces.com/blog/entry/129992 in this editorial , the editorial of c, what if the no bad exist, like n = 2, m=2; a == (3 3 5 5 1) b == (5 5 3 3 2) i will not consider the 1,2 as it is at the m+n+1 index so before that no bad exist, am i wrong ?
Name |
---|