poj1050 二维数组最大子序列矩阵和

最新推荐文章于 2021-11-17 15:38:11 发布

waka401

最新推荐文章于 2021-11-17 15:38:11 发布

阅读量522

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/waka401/article/details/8122199

算法专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一种算法，用于在二维数组中找到具有最大和的子矩阵。通过将问题分解为一维数组的最大子序列和问题，然后应用一维最大子序列和算法，我们可以有效地解决这个问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

public class Main {
 
     public int findMaxSumOneDimensions(int[] arr) {
         int len = arr.length;
         int max = arr[0], sum = max;
         for (int i = 1; i < len; i++) {
             sum += arr[i];
             if (sum < 0)
                 sum = arr[i];
             if (max <= sum)
                 max = sum;
         }
         return max;
     }
 
     public int findMaxSumTwoDimensions(int[][] arr, int N) {
         int max = 0;
         int[] b = new int[N];
         for (int i = 0; i < N; i++) {
             for (int j = 0; j < N; j++)
                 b[j] = 0;
             for (int j = i; j < N; j++) {
                 for (int k = 0; k < N; k++)
                     b[k] += arr[j][k];
                 int temp = findMaxSumOneDimensions(b);
                 if (temp >= max)
                     max = temp;
             }
         }
         return max;
     }
 
     public static void main(String[] args) throws FileNotFoundException {
         // Scanner scanner = new Scanner(new BufferedInputStream(new
         // FileInputStream(new File("E:\\input.txt"))));
         Main main = new Main();
         Scanner scanner = new Scanner(new BufferedInputStream(System.in));
         int N = scanner.nextInt();
         int[][] arr = new int[N][N];
         for (int i = 0; i < N; i++) {
             for (int j = 0; j < N; j++) {
                 arr[i][j] = scanner.nextInt();
             }
         }
         System.out.println(main.findMaxSumTwoDimensions(arr, N));
     }
 }