xxxxxxxxxx
141516171819202122232425262728293031323334353637383940
} int max=0; int sum; int ind=1; for(int i=1;i<n-1;i++) { sum=0; for(int j=1;j<n-1;j++) { sum=a[i][j]+a[i-1][j-1]+a[i-1][j+1]+a[i-1][j]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j+1]+a[i+1][j]; System.out.println("Sum of substring"+ind+":"+sum); ind++; } if(sum>max) { max=sum; } } System.out.println("Maximum:"+max); } }
xxxxxxxxxx
141516171819202122232425262728293031323334353637383940
} int max=0; int sum; int ind=1; for(int i=1;i<n-1;i++) { sum=0; for(int j=1;j<n-1;j++) { sum=a[i][j]+a[i-1][j-1]+a[i-1][j+1]+a[i-1][j]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j+1]+a[i+1][j]; System.out.println("Sum of substring"+ind+":"+sum); ind++; } if(sum>max) { max=sum; } } System.out.println("Maximum:"+max); } }