Optimizing DP with Monotonic Stacks : Codeforces Educational Round 160D : Array Collapse
Timestamp
0:00 Problem Overview
0:52 Practice Contest & CF Group
2:13 DP Definition
3:27 Populating DP Values
8:36 Final Answer
9:38 O(N^2) Code
11:21 Terminal Minima
13:53 PSE Stack
17:23 O(N) Code
Пікірлер: 16
The best explanation I have ever seen! Keep it up pls🔥
Awesome job dude! Please keep doing this
Great explanation, thanks a lot for this! Keep up the good work! 🔥
Thank you so much, this helped a lot!
Great explanation👍
Awesome!
Excellent Bro Nice Optimization
nicely explained
Thanx boi, will subscribe
Thanks man , if anyone still faces doubt ,u can comment i will try to solve as well
really amazing solution.. especially i liked how you started then gave the O(n^2) solution.. then the optimised one.. great soon you will get more subscriber.. keep posting C and D of div 2.. and D,E,F for div3..
👍👍
Practice Contest : codeforces.com/group/7Dn3ObOpau/contest/493739 Code : cfstep.com/codeforces/contests/contest-1913/problem-d/
do cf more
indian...
@Avighna
6 ай бұрын
... so what?