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
@파이근삿값의날Ай бұрын
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!
@robinyounes170Ай бұрын
great explanation !
@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.
@munvut877Ай бұрын
i thought of Sliding Window + Prefix sum
@juniper9903 ай бұрын
Question, what recording program do you use?
@cfstepunfiltered3 ай бұрын
The builtin recorder that comes with Nvidia graphics card -- Shadowplay
@QBitWorld4 ай бұрын
crazy 🔥
@Ahryno7814 ай бұрын
How can you solve hard problems while you are pupil
@cfstepunfiltered4 ай бұрын
I am not good at solving problems fast. Also, I don't participate in contests that frequently. If I give contests seriously, I would guess that my actual rating would be around 1600. But unfortunately I do not have the time or motivation to grind.