Palindromic characteristics of string s with length |s| is a sequence of |s| integers, where k-th number is the total number of non-empty substrings of s which are k-palindromes.
A string is 1-palindrome if and only if it reads the same backward as forward.
A string is k-palindrome (k > 1) if and only if:
- Its left half equals to its right half.
- Its left and right halfs are non-empty (k - 1)-palindromes.
The left half of string t is its prefix of length ⌊|t| / 2⌋, and right half — the suffix of the same length. ⌊|t| / 2⌋ denotes the length of string tdivided by 2, rounded down.
Note that each substring is counted as many times as it appears in the string. For example, in the string "aaa" the substring "a" appears 3 times.
The first line contains the string s (1 ≤ |s| ≤ 5000) consisting of lowercase English letters.
Print |s| integers — palindromic characteristics of string s.
abba
6 1 0 0
abacaba
12 4 1 0 0 0 0
In the first example 1-palindromes are substring «a», «b», «b», «a», «bb», «abba», the substring «bb» is 2-palindrome. There are no 3- and 4-palindromes here.
//2017-08-02 11:15
//2017-08-02 12:30
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MaxN = 5e3;
int dp[MaxN + 5][MaxN + 5];
LL ans[MaxN + 5];
char s[MaxN + 5];
int len;
void init(){
for(int i = 0; i < len; i++){
int l = 0;
while(i - l >= 0 && i + l < len && (s[i - l] == s[i + l]))
dp[i - l][i + l] = 1, l++, ans[1]++;
l = 0;
while(i - l >= 0 && i + l + 1 < len &&(s[i - l] == s[i + l + 1]))
dp[i - l][i + l + 1] = 1, l++, ans[1]++;
}
}
void solve(){
for(int k = 2; k <= len; k++){
for(int i = 0; i < len; i++){
int j = i + k - 1;
if(j > len) break;
int mid = i + k / 2 - 1;
if(dp[i][j] && dp[i][mid]){
dp[i][j] = max(dp[i][j], dp[i][mid] + 1);
ans[dp[i][j]]++;
}
}
}
}
int main(){
while(~scanf("%s", s)){
len = strlen(s);
init();
solve();
for(int i = len; i >= 2; i--) ans[i] = ans[i] + ans[i + 1];
for(int i = 1; i <= len; i++) printf("%d ", ans[i]);
}
return 0;
}