Code Rod Cutting Problem using Dynamic Programming

[Remorax]

Problem:
Given a Rod of length N and an array A containing prices of all pieces of size lesser than N.
Find the maximum value which can be achieved by cutting the rod and selling the pieces.

Input Format:
First line contains the size of rod N
Second line contains the array A_1,A_2,... A_(n-1)
A_i stores the price of rod of length i

Output Format:
Output the answer to the above problem on first line.

I would like to work on this problem :)