Hey guys! I was doing some problems when i faced situation where i get stuck and cant proceed further. Lately i m facing some problems in identifying dp questions . I know some of the standard dp problems but for new problems which i haven't seen before i used to judge whether its dp or not (mostly) by the constraints .

But lately this stupid approach of mine has failed miserably. in this Div2 D though n<=3k its easier approach is greedy and i was trying it with dp but didnt reach anywhere , i have seen some dp solutions too in standings but they are quite lengthy .

And the real problem comes when its linear dp which is what i fail to recognize most of the times . As in , this edu_D_problem.As in editorial i was ready for the ans with k>0 case but was doing a lot of casework(which is troublesome and given wrong results) for k<=0 which is avoided and done with dp in editorial.

Guys thats why i want some help regarding this issue. i did approach my friends regarding this issue and they too have more or less same problem . So asking from the community.