Longest Symmetric String

#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll MOD=1000000007;
const ll P=10000019;
const ll MAXN=1010;
ll powP[MAXN],H1[MAXN],H2[MAXN];
void init(){
    powP[0]=1;
    for(int i=1;i<MAXN;i++){
        powP[i]=(powP[i-1]*P)%MOD;
    }
}
void calH(ll H[],string &str){
    H[0]=str[0];
    for(int i=1;i<str.length();i++){
        H[i]=(H[i-1]*P+str[i])%MOD;
    }
}
int calStringleSubH(ll H[],int i,int j){
    if(i==0)return H[j];
    return ((H[j]-H[i-1]*powP[j-i+1])%MOD+MOD)%MOD;
}
int binarySearch(int l,int r,int len,int i,int isEven){
    while(l<r){
        int mid=(l+r)/2;
        int H1L=i-mid+isEven,H1R=i;
        int H2L=len-1-(i+mid),H2R=len-1-(i+isEven);
        int hashL=calStringleSubH(H1, H1L, H1R);
        int hasR=calStringleSubH(H2,H2L,H2R);
        if(hashL!=hasR)r=mid;
        else l=mid+1;
    }
    return l-1;
}
int main(){
    init();
    string str;
    getline(cin,str);
    calH(H1,str);
    reverse(str.begin(),str.end());
    calH(H2, str);
    int ans=0;
    for(int i=0;i<str.length();i++){
        int maxLen=min(i,(int)str.length()-1-i)+1;
        int k=binarySearch(0,maxLen,str.length(),i,0);
        ans=max(ans,k*2+1);
    }
    for(int i=0;i<str.length();i++){
        int maxLen=min(i+1,(int)str.length()-1-i)+1;
        int k=binarySearch(0,maxLen,str.length(),i,1);
        ans=max(ans,k*2);
    }
    printf("%d\n",ans);
    return 0;
}