二维数组求最大联通数组最大值

实验代码：

package demo;
import java.util.*;
public class Lmax {
static Scanner scanner = new Scanner(System.in);
public static void main(String args[]){
int m,n;
int b;
Scanner scanner = new Scanner(System.in); 
System.out.println("请输入二维数组的列数：");
m = scanner.nextInt();
System.out.println("请输入二维数组的行数：");
n = scanner.nextInt();
int arr[][] = new int[n][m];
System.out.println("请输入：");
for(int i = 0;i<n;i++)
for(int j=0;j<m;j++)
{
arr[i][j] = scanner.nextInt();
}
System.out.println(" ");
b = maxArrSum(arr);
System.out.println("最大联通数组和为"+b);
}

public static int[][] arrSum(int arr[][]){
int m = arr.length;
int n = arr[0].length;
int p[][] = new int[m+1][n+1];
p[0][0] = arr[0][0];
for(int i=0; i<=m; i++) p[i][0] = 0;
for(int i=0; i<=n; i++) p[0][i] = 0;
for(int i=1; i<=m; i++){
for(int j=1; j<=n; j++){
p[i][j] = p[i-1][j] + p[i][j-1] + arr[i-1][j-1] - p[i-1][j-1];
}
}
return p;
}

static int maxArrSum(int arr[][]){
int m = arr.length;
int n = arr[0].length;
int p[][] = arrSum(arr);
int ans = Integer.MIN_VALUE;
for(int i=1; i<=m; i++){
for(int j=1; j<=n; j++){
for(int endi=i; endi <=m; endi++){
for(int endj=j; endj<=n; endj++){ 
int sum = p[endi][endj] - p[i-1][endj] - p[endi][j-1] + p[i-1][j-1];
if(ans < sum) ans = sum; 
}
} 
} 
} 
return ans; 
}

}

实验截图：

实验思想：

遍历二维数组，将所有正整数分块，验证是否联通，如果不联通，判断路径