poj 1050 最大子矩阵

 1 import java.util.Arrays;
 2 import java.util.Scanner;
 3 
 4 public class Main{
 5     
 6     public static void main(String []args){
 7         Scanner cin = new Scanner(System.in);
 8         int [][] matrix = new int [105][105];
 9         int [] map = new int [105];
10         int n,i,j,k;
11         int max;
12          
13         n = cin.nextInt();
14         for(i = 1; i <= n; i ++)
15             for(j = 1; j <= n; j ++)
16                 matrix[i][j] = cin.nextInt();
17         
18         max = -100000000;
19         int sum;
20         
21         for(i = 1; i <= n; i ++)
22         {
23             Arrays.fill(map,0);
24             for(j = i; j <= n; j ++)
25             {
26                 for(k = 1,sum = 0; k <= n; k ++)
27                 {
28                     map[k] += matrix[j][k];
29                     sum = sum + map[k] > 0 ? sum + map[k]:0;
30                     if(sum > max) max = sum;
31                 }
32             }
33         }
34         
35         
36         System.out.println(max);
37     }
38 }

转载于:https://www.cnblogs.com/coolwind-sea/archive/2012/08/14/2637887.html