题意:按照题目给的字符串的顺序,每次添加一个字符,问你当前本质不同的回文串有多少个?
题解:回文数模板题,学了一发大佬的模板:http://blog.csdn.net/u013368721/article/details/42100363
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 100005;
const int N = 26;
struct Palindromic_Tree
{
int next[maxn][N];
int fail[maxn],cnt[maxn];
int len[maxn],S[maxn];
int last,p,n;
int newnode(int x)
{
for(int i=0;i<N;i++)
next[p][i]=0;
cnt[p]=0;len[p]=x;
return p++;
}
void init()
{
p=0;
newnode(0);
newnode(-1);
last=n=0;
S[n]=-1;
fail[0]=1;
}
int getfail(int x)
{
while(S[n-len[x]-1]!=S[n])
x=fail[x];
return x;
}
int add(int c)
{
int ret=0;
c=c-'a';S[++n]=c;
int cur=getfail(last);
if(!next[cur][c])
{
ret=1;
int now=newnode(len[cur]+2);
fail[now]=next[getfail(fail[cur])][c];
next[cur][c]=now;
}
last=next[cur][c];
cnt[last]++;
return ret;
}
void count()
{
for(int i=p-1;i>=0;i--)
cnt[fail[i]]+=cnt[i];
}
};
Palindromic_Tree T;
char s[maxn];
int n;
void solve()
{
int ans=0;
T.init();
n=strlen(s);
for(int i=0;i<n;i++)
printf("%d%c",ans+=T.add(s[i]),i<n-1 ? ' ' : '\n');
}
int main(void)
{
while(scanf("%s",s)!=EOF)
{
solve();
}
return 0;
}