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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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 |
---|