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

Design ideas:

1, first input a two-dimensional integer array (with positive negative);

2, followed by select from the array to choose the smallest number, if the negative is removed, test connectivity;

3, Unicom, the next to find the minimum number of the remaining, if the negative is removed, test connectivity; If positive, the maximum sum is available.

4, if it is not established in the inspection of the Unicom, then save the recent array of Unicom and.

5. Loop through the 3rd step until all possible unicom arrays are saved and the maximum value is found.

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