poj 2406(Power Strings)后缀数组

后缀数组的应用。

#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#define maxn 10000005
using namespace std;
int r[maxn];
char cc;
int nex[maxn];
int main()
{
    int i,n,m,p;
    while(1)
    {
        m=0;
        while(1){
            scanf("%c",&cc);
            if(cc=='\n')
            break;
            r[m++]=cc-'a'+2;
        }
        if(m==1&&r[0]=='.'-'a'+2)
            break;
        if(m==1&&r[0]==' '-'a'+2){
            printf("0\n");
            continue;
        }
        if(m==1){
            printf("1\n");
            continue;
        }
        nex[0]=-1;
        n=0;
        p=-1;
        while(n<m){
            if(p==-1||r[n]==r[p]){
                p++;
                n++;
                nex[n]=p;
            }
            else
                p=nex[p];
        }
        if(nex[n]==0||nex[n]==-1){
            printf("1\n");
            continue;
        }
        int q=n-nex[n];
        p=n;int ss=0;
        while(p!=0&&p!=-1){
            if(p-nex[p]!=q){
                ss=1;
                break;
            }
            p=nex[p];
        }
        if(ss){
            printf("1\n");
        }
        else
            printf("%d\n",n/(n-nex[n]));
    }
}