Rod Cutting Problem

Given a rod of length n inches and a table of prices p_i, i=1,2,…,n, write an algo­rithm to find the max­i­mum rev­enue r_n obtain­able by cut­ting up the rod and sell­ing the pieces.
http://algorithms.tutorialhorizon.com/dynamic-programming-rod-cutting-problem/
http://www.geeksforgeeks.org/dynamic-programming-set-13-cutting-a-rod/