Hi can anyone tell any dp approach to this?
Problem link==> http://codeforces.com/contest/1151/problem/B
I can think of a O(n*m*2^10) But it will not pass.
Thanks in advance.
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | adamant | 156 |
5 | cry | 155 |
5 | atcoder_official | 155 |
5 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
Please Help with dp problem?
Hi can anyone tell any dp approach to this?
Problem link==> http://codeforces.com/contest/1151/problem/B
I can think of a O(n*m*2^10) 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 |
---|