do we need to solve DP problems separately or just keep solving the problems in mixed pool and eventually everything will fall at its place
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
do we need to solve DP problems separately or just keep solving the problems in mixed pool and eventually everything will fall at its place
link to problem — (https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1285) link to my code — (https://ideone.com/pAMZpL) i am getting WA and not able to figure out why? thank you
Here is my submission.can someone point out my mistake thanks in advance. link to my submission
`
can somebody explain me the logic of problem E of abc 168.https://atcoder.jp/contests/abc168/tasks/abc168_e.i know that the points chosen according to given condition will form perpendicular lines but i am not able to proceed further.
HOW TO SOLVE THE INEQUALITY i*(i + 1) <= n such that i is maximum possible in O(1) time complexity.is their exist any method.
I am using 3 pointer technique to minimize the difference between largest and smallest element chosen and then finding the mid element which minimizes the answer. here is link to my code: https://ideone.com/XzeUzs thanks in advance
Name |
---|