I am finding a hard time solving Sherlock and Cost. it is given in dynamic programming section but i am not able to think it recursively or in a dp way ..... here's the link for the problem...

https://www.hackerrank.com/challenges/sherlock-and-cost/problem

can anyone tell how to approach the problem .. i know the fact that only 1 or the b[i] would be in the answer.!!!