Hello Guys
I need help with the problem 489C. I have started learning Dp and am trying to solve question with dp tag starting from most solved. So it would be helpful if you could describe in detail. Thanks in advance
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
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 |
I need help with the problem 489C. I have started learning Dp and am trying to solve question with dp tag starting from most solved. So it would be helpful if you could describe in detail. Thanks in advance
Название |
---|
Hi!
Firstly, you should probably have placed a link to the problem in your post, in order to make easier looking for it for someone who wants to help you.
Secondly, this problem has a good one greedy solution described in editorial. I think, you don't have to look for exactly dp solution, if you know how to write the greedy one.
If you don't or still looking for dp solution, you can write me in private messages for not keping this theme in recent posts :)