comefrom: <gouthampradhan>dynamic_programming_MaximumVacationDays_1.java
code: public int maxVacationDays(int[][] flights, int[][] days) {
      int N = days.length;
      int W = days[0].length;
      int[][] DP = new int[N][W + 1];
      for (int w = W - 1; w >= 0; w--) {
        for (int n = 0; n < N; n++) {
          DP[n][w] = days[n][w] + DP[n][w + 1];
        }
        for (int n = 0; n < N; n++) {
          int max = Integer.MIN_VALUE;
          int[] F = flights[n];
          for (int i = 0; i < F.length; i++) {
            if (F[i] == 1) {
              max = Math.max(max, days[i][w] + DP[i][w + 1]);
            }
          }
          DP[n][w] = Math.max(DP[n][w], max);
        }
      }
      return DP[0][0];
    }
masked: public int sample_funcname ( int [ ] [ ] var_0 , int [ ] [ ] var_1 ) {
    int var_3 = var_1 . length ;
    int var_5 = var_1 [ 0 ] . length ;
    int [ ] [ ] var_7 = new int [ var_3 ] [ var_5 + 1 ] ;
    for ( int var_8 = var_5 - 1 ;
    var_8 >= 0 ;
    var_8 -- ) {
      for ( int var_9 = 0 ;
      var_9 < var_3 ;
      var_9 ++ ) {
        var_7 [ var_9 ] [ var_8 ] = var_1 [ var_9 ] [ var_8 ] + var_7 [ var_9 ] [ var_8 + 1 ] ;
      }
      for ( int var_9 = 0 ;
      var_9 < var_3 ;
      var_9 ++ ) {
        int max = Integer . MIN_VALUE ;
        int [ ] var_13 = var_0 [ var_9 ] ;
        for ( int var_14 = 0 ;
        var_14 < var_13 . length ;
        var_14 ++ ) {
          if ( var_13 [ var_14 ] == 1 ) {
            max = Math . max ( max , var_1 [ var_14 ] [ var_8 ] + var_7 [ var_14 ] [ var_8 + 1 ] ) ;
          }
        }
        var_7 [ var_9 ] [ var_8 ] = Math . max ( var_7 [ var_9 ] [ var_8 ] , max ) ;
      }
    }
    return var_7 [ 0 ] [ 0 ] ;
  }
  