[学习笔记] Z-Box算法

网上多得是，直接上代码：

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define N 1000010
using namespace std;
char s[N];int z[N],n;
int main()
{
    scanf("%s",s+1);n=strlen(s+1);
    for(int i=2,l=1,r=0;i<=n;i++)
    {
        (i>r)?(z[i]=(s[i]==s[1])):(z[i]=min(z[r-l+1-(r-i)],r-i+1));
        while(i+z[i]<=n&&s[i+z[i]]==s[1+z[i]]) z[i]++;
        if(i+z[i]>r&&z[i]) l=i,r=i+z[i]-1;
    }
    for(int i=1;i<=n;i++) printf("%d\n",z[i]);return 0;
}