I tried a solution based on dp but I am getting WA: link to my solution: https://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 | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 149 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | cry | 142 |
Need help with 1113A
I tried a solution based on dp but I am getting WA: link to my solution: https://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 |
---|