Poj 2165 Milking Grid(kmp)

Milking Grid
Time Limit: 3000MS Memory Limit: 65536K
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’.
Source
USACO 2003 Fall

/*
kmp.
一开始传参数呵呵了.
忘了n和m相等的情况.
先把行看做一个整体做kmp.
然后把列看做一个整体做kmp.
*/
#include<iostream>
#include<cstdio>
#include<cstring>
#define MAXN 10001
#define MAXM 81
using namespace std;
int n,m,k,w,next[MAXN];
char g[MAXN][MAXM];
bool check(int x,int y,bool flag)
{
    if(flag)
    {
        for(int i=1;i<=m;i++) if(g[x][i]!=g[y][i]) return false;
        return true;
    }
    else
    {
        for(int i=1;i<=k;i++) if(g[i][x]!=g[i][y]) return false;
        return true;
    }
}
void kmp(int x,bool flag)
{
    int p=0;
    for(int i=2;i<=x;i++)
    {
        p=next[i-1];
        while(p&&!check(i,p+1,flag)) p=next[p];
        if(check(i,p+1,flag)) p++;
        next[i]=p;
    }
}
void slove()
{
    kmp(n,1);k=n-next[n];
    memset(next,0,sizeof next);
    kmp(m,0);w=m-next[m];
    return ;
}
int main()       
{
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;i++)
      for(int j=1;j<=m;j++)
        cin>>g[i][j];       
    slove();
    printf("%d\n",k*w);
    return 0;
}