Making all possible vertical cuts , one by one and calculating the sum of minimum invalid area for both the resulting pieces
for ( int i = 1 ; i < l ; i ++ ) { ans = min ( ans , minInvalidAreaUtil ( i , b ) + minInvalidAreaUtil ( l - i , b ) ) ; }