How to approach Dynamic graph related problems?

How many different kinds of DP problems can you enumerate if prompted to do so?

• It was a smooth journey solving simple variations of classical DP problems... Whenever i encountered a string, i made a dp table storing 1 if the string met the specifications of the problem and 0 otherwise. Few similar easy problems didn't hurt much, all i had to do was to figure out a recursive idea and code it off.   But soon i started encountered "weird" problems that literally blew my mind. One of them was minimizing (max-min) of elements of 'n' given sets by storing them into an array and doing complex operations on the array. It didn't even involve recursion! All this baffled me, i wished i could get subjective enumeration and description of all the dp problems you have ever encountered in your programming career, that can help in better understanding of dp domains. Related links to similar problems are welcome. Hoping to see an enthusiastic response covering all most all areas and variations of "D" "P". Though there are infinite variations possible in programming , yet there are certainly few must-do problem on any domain of programming. Any voluntary desire to enumerate problems of other topics besides DP, like greedy, amortized analysis, game theory, graph theory, probability, computational geometry or max flow are appreciated!

• Answer:

  I was trying to build a list of algorithms used in programming contests Here's the result http://translate.google.com/translate?hl=en&sl=ro&tl=en&u=http%3A%2F%2Finfoarena.ro%2Ftraining-path