题目描述:
Have you ever watched the movie Matrix ?
In that movie,
the term Matrix does not mean a mathematical thing,
but a complicated AI system.
In this problem,
we will go back to the original meaning of matrix.
Given a 0-1 matrix,
you are required to find the maximum submatrix in it
which contains only 0s.
Input
The first line of input is the number of test case.
For each test case:
The first line contains two integers N and M.
The next N lines each contains M integers, Aij.
There is a blank line before each test case.
1 <= N,M <= 1000
0 <= Aij <= 1
Output
For each test case output the answer on a single line.
Sample Input
2
2 2
0 0
0 0
4 5
1 0 1 0 0
0 1 0 0 0
0 0 1 0 0
1 1 0 0 0
Sample Output
4
8
Source
8th SCUPC
Author
This problem is in memory of SOJ2096--Maximum Submatrix.