题解报告:poj 2185 Milking Grid(二维kmp)

Posted acgoto

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了题解报告:poj 2185 Milking Grid(二维kmp)相关的知识,希望对你有一定的参考价值。

Description

Every morning when they are milked, the Farmer John‘s cows form a rectangular grid that is R (1 <= R <= 10,000) rows by C (1 <= C <= 75) columns. As we all know, Farmer John is quite the expert on cow behavior, and is currently writing a book about feeding behavior in cows. He notices that if each cow is labeled with an uppercase letter indicating its breed, the two-dimensional pattern formed by his cows during milking sometimes seems to be made from smaller repeating rectangular patterns. 
Help FJ find the rectangular unit of smallest area that can be repetitively tiled to make up the entire milking grid. Note that the dimensions of the small rectangular unit do not necessarily need to divide evenly the dimensions of the entire milking grid, as indicated in the sample input below. 

Input

* Line 1: Two space-separated integers: R and C 
* Lines 2..R+1: The grid that the cows form, with an uppercase letter denoting each cow‘s breed. Each of the R input lines has C characters with no space or other intervening character. 

Output

* Line 1: The area of the smallest unit from which the grid is formed 

Sample Input

2 5
ABABA
ABABA

Sample Output

2

Hint

The entire milking grid can be constructed from repetitions of the pattern ‘AB‘.
解题思路:
AC代码:
 


以上是关于题解报告:poj 2185 Milking Grid(二维kmp)的主要内容,如果未能解决你的问题,请参考以下文章

poj 2185 Milking Grid

Match:Milking Grid(二维kmp算法)(POJ 2185)

字符串KMP || POJ 2185 Milking Grid

POJ 2185 Milking Grid (搬运KMP)

POJ 2185 Milking Grid--另一种字符串的循环节

●POJ poj 2112 Optimal Milking