Need help with Dynamic Programming.

Revision en2, by AJ_Forces, 2024-11-10 01:18:43

Hey there CF fam! I just became Pupil in the last contest and couldn't solve problem C. After the contest I saw that it could've been solved by DP. DP is my weakest topic. In all of the contests I have given, I have never been able to solve a single dp problem. I have practiced many problems on Leetcode and few on CF as well but I still feel lost whenever I see a dp problem. I looked up several blogs on CF and Leetcode and have solved several of the problems from the suggested lists(I was able to solve those maybe because I knew in advance that this will be solved by dp) but still can't feel even slightly confident about DP problems in general. Have you guys ever faced this problem? Can any of you help me out with this?

Although I am a newbie but I have studied topics like dp, graphs, segment trees, DSU, etc and have solved problems based on these on Leetcode(mostly) and on CF as well. Just because of my bad contest temperament and weakness in DP, I am not able to go beyond problem C in any div2 contest.

Tags dp, newbie

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English AJ_Forces 2024-11-10 01:18:43 0 (published)
en1 English AJ_Forces 2024-11-10 01:17:30 1058 Initial revision (saved to drafts)