Hi can anyone tell any dp approach to this?
Problem link==> http://mirror.codeforces.com/contest/1151/problem/B
I can think of a O(n*m*2^10) But it will not pass.
Thanks in advance.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
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://mirror.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. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
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) |
Название |
---|