Rod Cutting DP

#include<bits/stdc++.h>
using  namespace  std;
#define endl         "\n"
#define ll           long long


int cutRod(int price[], int n)
{
    int val[n+1];
    val[0] = 0;

    for (int i = 1; i<=n; i++){

        int max_val = INT_MIN;
        for (int j = 0; j < i; j++) {

            int v = val[i - j - 1];
            max_val = max(max_val, price[j] + v);
        }
        val[i] = max_val;
    }

    return val[n];
}

int main()
{
    int arr[] = {1, 5, 8, 9, 10, 17, 17, 20};

    // here length of the rod is n
    int n = sizeof(arr) / sizeof(arr[0]);
    cout <<"Maximum Obtainable Value is "<<cutRod(arr, n);
    return 0;
}