UIT problemset #2
1. Problem 8.02:
2. Problem 8.03:
3. Problem 8.04:
4. Problem 8.05:
5. Problem ngày lễ:
6. Problem 8.06:7. Problem 8.08:
8. Problem 8.09:
9. Problem 8.10:
Kadane's algorithm - Finding maximum rectangular submatrix
Given a 2D matrix, find the maximum sum of a rectangular submatrix in it. For example, the maximum sum of the matrix is shown below. And the total value of this maximum submatrix is 15. As far as we know, Kadane's algorithm is used for finding the maximum subarray in a 1D array in O(n) time complexity: From the beginning, start to accumulate every element it goes through. If at a time, the sum is negative, we will reset the sum to 0, because it is always more beneficial to start from 0 rather than a negative value. I made the gif below to make it easier to understand this approach. The idea for solving the 2D array is similar: We will fix the two columns of the matrix - the left and the right - one by one. Then, we would consider every row of the matrix (lying between two columns) to be an element in a 1D array and apply Kadane's algorithm to this array. In other words, we will fix two columns i and j. Let's call b[k] = sum(a[k][i], a[k][i + 1], ..., a[k][j]), we can calcu...
Comments
Post a Comment