CASE II If all elements are negative and k is odd then max product will be product of rightmost - subarray of size k
if ( A [ n - 1 ] <= 0 && ( k & 1 ) ) { for ( int i = n - 1 ; i >= n - k ; i -- ) product *= A [ i ] ; return product ; }