【CodeForces】835D Palindromic characteristics

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=5010;
int f[maxn][maxn],n,ans[maxn];
char s[maxn];
bool h[maxn][maxn];
int main()
{
    scanf("%s",s+1);
    n=strlen(s+1);
    for(int i=1;i<=n;i++){f[i][i]=h[i][i]=h[i][i-1]=1;ans[1]++;}
    for(int p=2;p<=n;p++){
        for(int i=1;i+p-1<=n;i++){
            int j=i+p-1;
            h[i][j]=h[i+1][j-1]&(s[i]==s[j]);
            f[i][j]=h[i][j]?f[i][(i+j-1)/2]+1:0;
            ans[f[i][j]]++;
        }
    }
    for(int i=n;i>=1;i--)ans[i]+=ans[i+1];
    for(int i=1;i<=n;i++)printf("%d ",ans[i]);
    return 0;
}