Returns the and (thought) of the largest interconnected subarray in a two-dimensional integer array

Returns the and of the largest interconnected subarray in a two-dimensional integer array

Topic:

Enter a two-dimensional shaping array with positive numbers in the array and a negative number.

The maximum value for the and of all sub-arrays.

Ideas:

First, to parse a two-dimensional array, you usually want to degenerate it into a one-dimensional array. First, the largest subarray of each one-dimensional array is asked, and the subscript of the largest one-dimensional subarray of each row is noted. This will be divided into two cases: the first is the maximum number of sub-arrays between rows is connected, then can be directly added to get, the second is not connected, at this time, the largest sub-array of each row as a whole, and then to connect each of the largest array block, so that the minimum cost of its connection. Finally, we get the maximum of the number of interconnected sub-arrays.

(method two) in the two-dimensional shaping array, the data may be positive and negative, the maximum value, we focus on positive numbers, so to first determine which positions in the two-dimensional array is positive, the other two-dimensional array to record the position of the positive number, and then determine which numbers are connected. First locate the maximum value of this two-dimensional array, and then in the analysis of the value of 4 numbers around, unicom the 4 number of positive numbers, if all negative, then find the sub-large value, and the maximum value of Unicom, to determine the pre-Unicom and Unicom after the worth of size, if the smaller is not connected to the maximum value, and so on Until the maximum Unicom sub-array How to connect is smaller than the original value.

Returns the and (thought) of the largest interconnected subarray in a two-dimensional integer array