Hi can anyone tell any dp approach to this?
Problem link==> http://codeforces.net/contest/1151/problem/B
I can think of a O(n*m*2^10) dp But it will not pass.
Thanks in advance.
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
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 |
Please Help with dp problem?
Hi can anyone tell any dp approach to this?
Problem link==> http://codeforces.net/contest/1151/problem/B
I can think of a O(n*m*2^10) dp 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) |
Название |
---|