comefrom: <gouthampradhan>dynamic_programming_SplitArrayLargestSum_1.java
code: public int splitArray(int[] nums, int m) {
      int[][] dp = new int[m][nums.length];
      for (int i = nums.length - 1; i >= 0; i--) {
        int sum = 0;
        for (int j = i; j < nums.length; j++) {
          sum += nums[j];
          if (j + 1 >= nums.length) break;
          for (int k = 0; k < m - 1; k++) {
            dp[k + 1][i] = (dp[k + 1][i] == 0) ? Integer.MAX_VALUE : dp[k + 1][i];
            int temp = Math.max(sum, dp[k][j + 1]);
            dp[k + 1][i] = Math.min(dp[k + 1][i], temp);
          }
        }
        dp[0][i] = sum;
      }
      return dp[m - 1][0];
    }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    int [ ] [ ] var_3 = new int [ var_1 ] [ var_0 . length ] ;
    for ( int var_5 = var_0 . length - 1 ;
    var_5 >= 0 ;
    var_5 -- ) {
      int var_7 = 0 ;
      for ( int var_8 = var_5 ;
      var_8 < var_0 . length ;
      var_8 ++ ) {
        var_7 += var_0 [ var_8 ] ;
        if ( var_8 + 1 >= var_0 . length ) break ;
        for ( int var_9 = 0 ;
        var_9 < var_1 - 1 ;
        var_9 ++ ) {
          var_3 [ var_9 + 1 ] [ var_5 ] = ( var_3 [ var_9 + 1 ] [ var_5 ] == 0 ) ? Integer . MAX_VALUE : var_3 [ var_9 + 1 ] [ var_5 ] ;
          int var_14 = Math . max ( var_7 , var_3 [ var_9 ] [ var_8 + 1 ] ) ;
          var_3 [ var_9 + 1 ] [ var_5 ] = Math . min ( var_3 [ var_9 + 1 ] [ var_5 ] , var_14 ) ;
        }
      }
      var_3 [ 0 ] [ var_5 ] = var_7 ;
    }
    return var_3 [ var_1 - 1 ] [ 0 ] ;
  }
  