|
||||||||||
Largest SubmatrixTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3485 Accepted Submission(s): 1623 Problem Description Now here is a matrix with letter 'a','b','c','w','x','y','z' and you can change 'w' to 'a' or 'b', change 'x' to 'b' or 'c', change 'y' to 'a' or 'c', and change 'z' to 'a', 'b' or 'c'. After you changed it, what's the largest submatrix with the same letters you can make? Input The input contains multiple test cases. Each test case begins with m and n (1 ¡Ü m, n ¡Ü 1000) on line. Then come the elements of a matrix in row-major order on m lines each with n letters. The input ends once EOF is met. Output For each test case, output one line containing the number of elements of the largest submatrix of all same letters. Sample Input
Sample Output
Source | ||||||||||
|