#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vvi; typedef vector vvvi; typedef vector vvvvi; typedef pair pi; typedef pair ppi; typedef pair pppi; typedef pair ppppi; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint&a){os<>S; ll N=sz(S); vector>DP(N+1,vector(N+1)); REP(i,N+1)DP[i][i]=1; REP(i,N)DP[i][i+1]=1; FOR(d,2,N+1)REP(i,N+1-d){ if(S[i]==S[i+d-1]&&DP[i+1][i+d-1])DP[i][i+d]=1; } vvi E(N); REP(i,N)REP(j,N+1)if(DP[i][j])E[i].emplace_back(j); ll l=0,r=N+1; while(r-l>1){ ll m=(l+r)/2; vectorA(N+1); A[0]=1; REP(i,N)if(A[i])for(auto j:E[i])if(j>=i+m)A[j]=1; if(A[N])l=m;else r=m; } cout<