Hi can anyone tell any dp approach to this?
Problem link==> http://codeforces.me/contest/1151/problem/B
I can think of a O(n*m*2^10) dp But it will not pass.
Thanks in advance.
# | 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 |
Please Help with dp problem?
Hi can anyone tell any dp approach to this?
Problem link==> http://codeforces.me/contest/1151/problem/B
I can think of a O(n*m*2^10) dp But it will not pass.
Thanks in advance.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | BanazadehAria | 2019-07-01 14:11:17 | 3 | Tiny change: 'n*m*2^10) But it wi' -> 'n*m*2^10) dp But it wi' | ||
en1 | BanazadehAria | 2019-07-01 14:06:49 | 212 | Initial revision (published) |
Name |
---|