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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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://codeforces.net/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 |
---|