Graph and DP problems are hot topics considering INOI , well I have practiced graphs well enough but pretty weak when comes to Dynamic programming.

Can someone direct me to some nice DP problems specific to INOI syllabus? Cause I being weak in DP, I am unable to figure out the approach , if thats in syllabus or not.

For example if anyone participated in codechef December Challenge he would know the KIRITO problem , I first tried to solve it using Graphs and DFS , well that solved the problem but took a healthy amount of time , and finally after a 2 or 3 days , I came to know that it is a DP problem just a variation of LIS problem

P.S -> I am strictly preparing for INOI