I've successfully solved this problem using Greedy Approach but in the editorial it was given that the probelm can also be solved using Dynamic Programming.

Can someone help me with the DP solution ? (preferably in C++)

Problem Link : http://mirror.codeforces.com/problemset/problem/489/B

Editorial Link : http://mirror.codeforces.com/blog/entry/14741

My Solution ( Greedy ) : 39216236