375B.md (1640B)
1 Source: https://codeforces.com/problemset/problem/375/B 2 3 B. Maximum Submatrix 2 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 512 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 You are given a matrix consisting of digits zero and one, its size is *n* × *m*. You are allowed to rearrange its rows. What is the maximum area of the submatrix that only consists of ones and can be obtained in the given problem by the described operations? 22 23 Let's assume that the rows of matrix *a* are numbered from 1 to *n* from top to bottom and the columns are numbered from 1 to *m* from left to right. A matrix cell on the intersection of the *i*-th row and the *j*-th column can be represented as (*i*, *j*). Formally, a submatrix of matrix *a* is a group of four integers *d*, *u*, *l*, *r* (1 ≤ *d* ≤ *u* ≤ *n*; 1 ≤ *l* ≤ *r* ≤ *m*). We will assume that the submatrix contains cells (*i*, *j*) (*d* ≤ *i* ≤ *u*; *l* ≤ *j* ≤ *r*). The area of the submatrix is the number of cells it contains. 24 25 Input 26 27 The first line contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 5000). Next *n* lines contain *m* characters each — matrix *a*. Matrix *a* only contains characters: "0" and "1". Note that the elements of the matrix follow without any spaces in the lines. 28 29 Output 30 31 Print a single integer — the area of the maximum obtained submatrix. If we cannot obtain a matrix of numbers one, print 0. 32 33 Examples 34 35 Input 36 37 ``` 38 1 1 39 1 40 ``` 41 42 Output 43 44 ``` 45 1 46 ``` 47 48 Input 49 50 ``` 51 2 2 52 10 53 11 54 ``` 55 56 Output 57 58 ``` 59 2 60 ``` 61 62 Input 63 64 ``` 65 4 3 66 100 67 011 68 000 69 101 70 ``` 71 72 Output 73 74 ``` 75 2 76 ```