p02327 Largest Rectangle
Problem Description
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest rectangle which only contains 0s.
Constraints
- 1 ≤ H, W ≤ 1,400
Input
H W c1,1 c1,2 ... c1,W c2,1 c2,2 ... c2,W : cH,1 cH,2 ... cH,W
In the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.
Output
Print the area (the number of 0s) of the largest rectangle.
Example
Input
4 5 0 0 1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 1 0
Output
6
Contest Information
- Contest ID: 0
- Problem Index:
- Points: 0.0
- Rating: 0
- Tags:
- Time Limit: {'seconds': 1, 'nanos': 0} seconds
- Memory Limit: 134217728 bytes
Task
Solve this competitive programming problem. Provide a complete solution that handles all the given constraints and edge cases.