codeforce 961 F. k-substrings 字符串多重Hash

codeforce 961 F. k-substrings

给定一个字符串，每次在串的两边减去一个字符求其每次减去之前最长的L（前缀==后缀）

hash 10次 减小冲突

#include<bits/stdc++.h>
using namespace std;
const int MAX=1e6+5;
const int HASH=10;
int AC[HASH]={131,137,139,149,151,157,163,167,173,179};
int ACC[HASH]={200003,200009,200017,200023,200029,200033,200041,200063,200087,200117};
long long bas[MAX][HASH],sum1[MAX][HASH];
int n,ans[MAX];
char s[MAX];
bool check(int index,int x,int len)
{
    long long ha1=((sum1[x+len-1][index]-sum1[x-1][index]*bas[len][index]%ACC[index])%ACC[index]+ACC[index])%ACC[index];
    long long ha2=((sum1[n-x+1][index]-sum1[n-x-len+1][index]*bas[len][index]%ACC[index])%ACC[index]+ACC[index])%ACC[index];
    if(ha1==ha2) return true;
    else return false;
}
bool check(int x,int len)
{
    for(int i=0;i<HASH;i++)
        if(!check(i,x,len)) return false;
    return true;
}
int main()
{
    scanf("%d",&n);
    scanf("%s",s+1);
    for (int i=0;i<HASH;i++)
    {
        bas[0][i]=1;
        for(int j=1;j<=n;j++) bas[j][i]=bas[j-1][i]*AC[i]%ACC[i];
        for(int j=1;j<=n;j++) sum1[j][i]=(sum1[j-1][i]*AC[i]%ACC[i]+s[j]-'a'+1)%ACC[i];
    }
    int mid=(n+1)>>1;
    for(int i=mid;i>=1;i--)
    {
        if(i==mid)
        {
            if(n%2==1) {ans[i]=-1;}
            else {if(s[i]==s[i+1]) ans[i]=1;else ans[i]=-1;}
        }
        else
        {
            ans[i] = ans[i+1]+2;
            while (ans[i]!=-1&&!check(i,ans[i])) ans[i]-=2;
        }
    }
    for(int i=1;i<=mid;i++) printf("%d ",ans[i]);printf("\n");
    return 0;
}