I tried a solution based on dp but I am getting WA: link to my solution: https://codeforces.net/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 | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Need help with 1113A
I tried a solution based on dp but I am getting WA: link to my solution: https://codeforces.net/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 |
---|