字符串算法模板

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<map>
#include<set>
#define rre(i,r,l) for(int i=(r);i>=(l);i--)
#define re(i,l,r) for(int i=(l);i<=(r);i++)
#define Clear(a,b) memset(a,b,sizeof(a))
#define inout(x) printf("%d",(x))
#define douin(x) scanf("%lf",&x)
#define strin(x) scanf("%s",(x))
#define LLin(x) scanf("%lld",&x)
#define op operator
#define CSC main
typedef unsigned long long ULL;
typedef const int cint;
typedef long long LL;
using namespace std;
void inin(int &ret)
{
    ret=0;int f=0;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=1;ch=getchar();}
    while(ch>='0'&&ch<='9')ret*=10,ret+=ch-'0',ch=getchar();
    ret=f?-ret:ret;
}
namespace sa//uoj#35
{
    char s[100050];
    int sa[100050],t[100050],t2[100050],c[100050],n,height[100050];
    void build_sa(int m)
    {
        int *x=t,*y=t2;
        re(i,0,m-1)c[i]=0;
        re(i,0,n-1)c[x[i]=s[i]]++;
        re(i,1,m-1)c[i]+=c[i-1];
        rre(i,n-1,0)sa[--c[x[i]]]=i;
        for(int k=1;k<=n;k<<=1)
        {
            int p=0;
            rre(i,n-1,n-k)y[p++]=i;
            re(i,0,n-1)if(sa[i]>=k)y[p++]=sa[i]-k;
            re(i,0,m-1)c[i]=0;
            re(i,0,n-1)c[x[y[i]]]++;
            re(i,0,m-1)c[i]+=c[i-1];
            rre(i,n-1,0)sa[--c[x[y[i]]]]=y[i];
            swap(x,y),x[sa[0]]=0,p=1;
            re(i,1,n-1)x[sa[i]]=y[sa[i-1]]==y[sa[i]]&&y[sa[i-1]+k]==y[sa[i]+k]?p-1:p++;
            if(p>=n)break;
            m=p;
        }
    }
    void build_height()
    {
        re(i,0,n-1)c[sa[i]]=i;
        int k=0;
        re(i,0,n-1)
        {
            if(!c[i])continue;
            if(k)k--;
            int j=sa[c[i]-1];
            while(s[i+k]==s[j+k])k++;
            height[c[i]]=k;
        }
    }
    void solve()
    {
        strin(s);n=strlen(s);
        build_sa(200);
        build_height();
        re(i,0,n-1)printf("%d%c",sa[i]+1,i==n-1?'
':' ');
        re(i,1,n-1)printf("%d%c",height[i],i==n-1?'
':' ');
    }
}
namespace acm//bzoj3172
{
    int ch[1000010][26],pre[1000010],last[1000010],sum[1000010],tag[1000010],ed;
    char s[1000010];
    int wei[222];
    void add(int id)
    {
        int len=strlen(s),temp=0;
        re(i,0,len-1)
        {
            int c=s[i]-'a';
            if(!ch[temp][c])ch[temp][c]=++ed;
            temp=ch[temp][c];
            sum[temp]++;
        }
        wei[id]=temp;
        tag[temp]=id;
    }
    queue<int>h;
    int sta[1000010],top;
    void getfail()
    {
        re(i,0,25)if(ch[0][i])pre[ch[0][i]]=0,h.push(ch[0][i]);
        while(!h.empty())
        {
            int x=h.front();h.pop();
            sta[++top]=x;
            re(i,0,25)
            {
                if(!ch[x][i])
                {
                    ch[x][i]=ch[pre[x]][i];
                    continue;
                }
                int vv=ch[x][i];
                int k=pre[x];
                pre[vv]=ch[k][i];
                last[vv]=tag[pre[vv]]?pre[vv]:last[pre[vv]];
                h.push(vv);
            }
        }
    }
    int n;
    void solve()
    {
        inin(n);
        re(i,1,n)strin(s),add(i);
        getfail();
        while(top)sum[pre[sta[top]]]+=sum[sta[top]],top--;
        re(i,1,n)printf("%d
",sum[wei[i]]);
    }
    
}
namespace kmp//bzoj1355
{
    char a[1000010],b[1000010];
    int n,m,pre[1000010];
    void getpre(char *s)
    {
        int k=0;n=strlen(s+1);
        re(i,2,n)
        {
            while(k&&s[i]!=s[k+1])k=pre[k];
            if(s[i]==s[k+1])k++;
            pre[i]=k;
        }
    }
    int kmp(char *chang,char *duan)
    {
        getpre(duan);
        int k=0;n=strlen(chang+1),m=strlen(duan+1);
        re(i,1,n)
        {
            while(k&&chang[i]!=duan[k+1])k=pre[k];
            if(chang[i]==duan[k+1])
            {
                k++;
                if(k==m)return i-m+1;
            }
        }
        return -1;
    }
    void solve()
    {
        inin(n);
        strin(a+1);
        getpre(a);
        printf("%d",n-pre[n]);
    }
}
namespace exkmp//bzoj3670
{
    char s[1000010],t[1000010];int pre[1000010],Max[1000010],sum[1000010];
    const int mod=1e9+7;
    void getpre(char *s)
    {
        int len=strlen(s),a=0;
        pre[0]=len;
        while(a<len-1&&s[a]==s[a+1])a++;
        pre[1]=a;
        a=1;
        re(k,2,len-1)
        {
            int p=a+pre[a]-1,l=pre[k-a];
            if(k-1+l>=p)
            {
                int j=(p-k+1)>0?(p-k+1):0;
                while(k+j<len&&s[k+j]==s[j])j++;
                pre[k]=j;
                a=k;
            }
            else pre[k]=l;
        }
    }
    void getextend(char *s,char *t)
    {
        int n=strlen(s),m=strlen(t),a=0;
        getpre(s);
        while(a<n-1&&s[a]==t[a+1])a++;
        Max[0]=a;
        a=1;
        re(k,1,n-1)
        {
            int p=a+Max[a]-1,l=pre[k-a];
            if(k+l-1>=p)
            {
                int j=(p-k+1)>0?(p-k+1):0;
                while(k+j<m&&s[k+j]==t[j])j++;
                Max[k]=j;
                a=k;
            }
            else Max[k]=l;
        }
    }
    int n,T;
    void solve()
    {
        inin(n);
        while(n--)
        {
            T++;
            strin(s);
            int len=strlen(s);
            getpre(s);
            re(i,1,len-1)
            {
                int r=min(i<<1,pre[i]+i);
                if(t[i]!=T)t[i]=T,sum[i]=1;
                else sum[i]++;
                if(t[r]!=T)t[r]=T,sum[r]=-1;
                else sum[r]--;
            }
            if(t[0]!=T)t[0]=T,sum[0]=0;
            LL ans=sum[0]+1;
            re(i,1,len-1)
            {
                if(t[i]!=T)t[i]=T,sum[i]=0;
                sum[i]+=sum[i-1];ans=ans*(sum[i]+1)%mod;
            }
            printf("%lld
",ans);
        }
    }
}
namespace pam
{
    const int xxxx=600010;//length
    int ch[xxxx][26];//son
    int pre[xxxx];//fail
    int sum[xxxx];//times
    int len[xxxx];//Max_length
    int ss[xxxx];//string
    int num[xxxx];//numbers
    int last,n,ed=-1;
    int newnode(int x)//you_know
    {
        len[++ed]=x;
        return ed;
    }
    void init()//pretreatment
    {
        newnode(0),newnode(-1);
        last=n=0;ss[n]=-1,pre[0]=pre[1]=1;
    }
    int getfail(int x)//you_know
    {
        while(ss[n-len[x]-1]!=ss[n])x=pre[x];
        return x;
    }
    void add(int c)//add_a_char
    {
        c-='a';
        ss[++n]=c;
        int temp=getfail(last);
        if(!ch[temp][c])
        {
            int now=newnode(len[temp]+2);
            int k=getfail(pre[temp]);
            pre[now]=ch[k][c];
            ch[temp][c]=now;
            num[now]=num[pre[now]]+1;
        }
        last=ch[temp][c];
        sum[last]++;
    }
    void add(char *s)//add_a_string
    {
        int limit=strlen(s);
        re(i,0,limit-1)add(s[i]);
    }
    void count()//clac_times
    {
        rre(i,ed,1)sum[pre[i]]+=sum[i];
    }
}
namespace manacher
{
    const int xxxx=5000050;
    char s[xxxx];
    int n,ans,len[xxxx];
    void solve()
    {
        strin(s+1);int m=strlen(s+1);
        rre(i,m,1)s[(i<<1)-1]=s[i],s[i<<1]='$';
        s[0]='$';n=m<<1;
        for(int i=1,j=0,k;i<n;i+=k,j=max(j-k,0))
        {
            while(i+j+1<=n&&s[i-j-1]==s[i+j+1])j++;
            len[i]=j;ans=max(ans,len[i]);
            for(k=1;k<=j&&len[i]-k!=len[i-k];k++)
                len[i+k]=min(len[i]-k,len[i-k]);
        }
        printf("%d",ans);
    }
}
int main()
{
     return 0;
}