Cutting a rod

/*
You are given a rod that is n centimeter long. You are also given an array of prices which contains prices of all pieces of the rod
which are smaller than n. You have to find out the maximum value that can be obtained by cutting the rod and selling the pieces. 
*/


import java.util.*;

public class Source
{
  static int cut_rod(int price[], int n)
  {
    // Complete this function to return the maximum value
    int profit[] = new int[n+1];
    for(int i = 1;i<=n;i++){
        for(int j =1;j<=i;j++){
            profit[i] = Math.max(profit[i], price[j-1]+profit[i-j]);
        }
    }
    return profit[n];
  }

public static void main(String args[])
    {
        int n;
        Scanner s = new Scanner(System.in);
        n = s.nextInt();
        int price[] = new int[n];
        for(int i = 0; i < n; i++)
            price[i] = s.nextInt();
 
        System.out.println(cut_rod(price, n) + "\n" );
    }
}