I am a newbie to the dynamic programming paradigm.. while trying to solve this question.......
How to find minimum sum of the numbers in an given array such that at least one of three consecutive elements are picked.
I do not understand how to divide this problem in to sub problems.