title: Recursively Break Number 3 Parts Get Maximum Sum 1
signature: function recursivelyBreakNumber3PartsGetMaximumSum1($n) {
source_py: def recursively_break_number_3_parts_get_maximum_sum_1(n):
      dp = ([0] * (n + 1))
      dp[0] = 0
      dp[1] = 1
      for i in range(2, (n + 1)):
          dp[i] = max(((dp[int((i / 2))] + dp[int((i / 3))]) + dp[int((i / 4))]), i)
      return dp[n]
source_cpp: int recursively_break_number_3_parts_get_maximum_sum_1(int n) {
    int dp [ n + 1 ];
    dp [ 0 ] = 0, dp [ 1 ] = 1;
    for ( int i = 2;
    i <= n;
    i ++ ) dp [ i ] = max ( dp [ i / 2 ] + dp [ i / 3 ] + dp [ i / 4 ], i );
    return dp [ n ];
  }