Leetcode 85. Maximal Rectangle

Given a binary matrix, find the area of the largest axis-aligned rectangle containing only 1s. The key challenge is to efficiently compute this by treating each row as a histogram of consecutive 1s and using the largest-rectangle-in-histogram (monotonic stack) technique to achieve near O(rows·cols) time.