POJ - 2406 Power Strings —— next数组求循环节

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 54168		Accepted: 22583

Description

Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = "" (the empty string) and a^(n+1) = a*(a^n).

Input

Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.

Output

For each s you should print the largest n such that s = a^n for some string a.

Sample Input

abcd
aaaa
ababab
.

Sample Output

1
4
3

题意：给定字符串，求（最小）循环节最多循环了多少次

思路：next数组求出循环节

#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <cstring>
#include <queue>
#include <algorithm>
#define ll long long
#define max_ 1010000
#define les 1e-6
#define inf 0x3f3f3f3f
using namespace std;
int f[max_];
char s[max_];
int main(int argc, char const *argv[]) {
    while(scanf(" %s",s))
    {
        if(s[0]=='.')
        break;
        f[0]=-1;
        int l=strlen(s);
        for(int i=1;i<l;i++)
        {
            int j=f[i-1];
            while((j>=0)&&(s[i]!=s[j+1]))
            j=f[j];
            if(s[i]==s[j+1])
            f[i]=j+1;
            else
            f[i]=-1;
        }
        int d=l-(f[l-1]+1);
        if(l%d==0)
        printf("%d\n",l/d);
        else
        printf("1\n" );
    }
    return 0;
}