Cutting a rod by DP

#include<iostream>
using namespace std;

int MaxValue(int arr[],int size){
  int max_val[size+1];
  max_val[1]=arr[0];
  max_val[0]=0;
  for(int i=1;i<size;i++){
    int sum=0;
    for(int j=i;j>=0;j--){
       int curr_sum=0;
       curr_sum=arr[j]+max_val[i-j];
       if(curr_sum>sum)
        sum=curr_sum;
      }
    max_val[i+1]=sum;
    }
    return max_val[size];
  }

int main(){
   int arr[] = {3, 5, 8, 9, 10, 17, 17, 20};
   int size = 8;
   cout<<MaxValue(arr, size);
  }