I tried a solution based on dp but I am getting WA: link to my solution: https://mirror.codeforces.com/contest/1113/submission/136000085
I got the greedy approach, just want to know if it can be solved using dp and what I am missing in dp.
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3885 |
3 | jqdai0815 | 3682 |
4 | Benq | 3580 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3506 |
7 | ecnerwala | 3505 |
8 | Radewoosh | 3457 |
9 | Kevin114514 | 3377 |
10 | gamegame | 3374 |
# | User | Contrib. |
---|---|---|
1 | cry | 170 |
2 | Um_nik | 162 |
2 | -is-this-fft- | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 154 |
8 | luogu_official | 153 |
9 | awoo | 152 |
10 | maomao90 | 150 |
Need help with 1113A
I tried a solution based on dp but I am getting WA: link to my solution: https://mirror.codeforces.com/contest/1113/submission/136000085
I got the greedy approach, just want to know if it can be solved using dp and what I am missing in dp.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 | strawhatdragon | 2021-11-17 20:11:07 | 256 | Initial revision (published) |
Name |
---|