Ural 1960 Palindromes and Super Abilities

Palindromes and Super Abilities

Time Limit: 1000ms

Memory Limit: 65536KB

This problem will be judged on Ural. Original ID: 1960
64-bit integer IO format: %lld      Java class name: (Any)

After solving seven problems on Timus Online Judge with a word “palindrome” in the problem name, Misha has got an unusual ability. Now, when he reads a word, he can mentally count the number of unique nonempty substrings of this word that are palindromes.

Dima wants to test Misha’s new ability. He adds letters s1, ..., sn to a word, letter by letter, and after every letter asks Misha, how many different nonempty palindromes current word contains as substrings. Which n numbers will Misha say, if he will never be wrong?

 

Input

The only line of input contains the string s1...sn, where si are small English letters (1 ≤ n ≤ 105).

 

Output

Output n numbers separated by whitespaces, i-th of these numbers must be the number of different nonempty substrings of prefix s1...si that are palindromes.

 

Sample Input

aba

Sample Output

1 2 3

Source

Ural FU contest. Kontur Cup. Petrozavodsk training camp. Winter 2013

 

解题：PalindromicTree

 #include <bits/stdc++.h>
 using namespace std;
 const int maxn = ;
 struct PalindromicTree{
     int fail[maxn],len[maxn],son[maxn][];
     int tot,last,n;
     char s[maxn];
     int newnode(int slen = ){
         memset(son[tot],,sizeof son[tot]);
         len[tot] = slen;
         return tot++;
     }
     void init(){
         n = tot = last = ;
         newnode();
         newnode(-);
         fail[] = fail[] = ;
         s[n] = -;
     }
     int getFail(int x){
         while(s[n - len[x] - ] != s[n]) x = fail[x];
         return x;
     }
     void extend(int c){
         s[++n] = c;
         int cur = getFail(last);
         if(!son[cur][c]){
             int x = newnode(len[cur] + );
             fail[x] = son[getFail(fail[cur])][c];
             son[cur][c] = x;
         }
         last = son[cur][c];
     }
 }pt;
 char str[maxn];
 int main(){
     while(~scanf("%s",str)){
         pt.init();
         bool flag = false;
         for(int i = ; str[i]; ++i){
             pt.extend(str[i] - 'a');
             if(flag) putchar(' ');
             printf("%d",pt.tot - );
             flag = true;
         }
         putchar('\n');
     }
     return ;
 }