C : Hungry Games Editorial for Codeforces Round 959

[@파이근삿값의날]

I solved this problem using two pointers, and dp, with time complexity of O(N). I counted the checkpoints backwards; the right side fixed, and counting all the checkpoints on the left side. This is a nice approach too!

[@coder-ky4yx]

great explanation , keep going bro

[@robinyounes170]

great explanation !

[@cfstepunfiltered]

Code cfstep.com/codeforces/contests/contest-1994/problem-c/

[@rahulv12s27]

are there any simple 1d array dp problems like this in cp? can you give us some similar practise problems if you know

[@cfstepunfiltered]

Sure, here's a list ABC291D Flip Cards ABC179D Leaping Tak CF1741E Sending a Sequence Over the Network ABC271E Subsequence Path ABC335F Hop Sugoroku CF1954D Colored Balls

[@munvut877]

i thought of Sliding Window + Prefix sum

[@sdmfslkdm]

bhai what is yor rating ?

[@cfstepunfiltered]

Newbie. But I don't participate in contests frequently.

[@hdcutz2936]

good but when you explain with markers not just using box you should also use the actual example so that it will be easy to understand more

[@cfstepunfiltered]

Noted, thanks.

[@omaraboutaleb3331]

title is wrong

[@cfstepunfiltered]

Fixed, thanks.