#line 1 "library/Template/template.hpp" #include using namespace std; #define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define ALL(v) (v).begin(),(v).end() using ll=long long int; const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; templateinline bool chmax(T& a,T b){if(ainline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;} #line 2 "library/Utility/fastio.hpp" #include class FastIO{ static constexpr int L=1<<16; char rdbuf[L]; int rdLeft=0,rdRight=0; inline void reload(){ int len=rdRight-rdLeft; memmove(rdbuf,rdbuf+rdLeft,len); rdLeft=0,rdRight=len; rdRight+=fread(rdbuf+len,1,L-len,stdin); } inline bool skip(){ for(;;){ while(rdLeft!=rdRight and rdbuf[rdLeft]<=' ')rdLeft++; if(rdLeft==rdRight){ reload(); if(rdLeft==rdRight)return false; } else break; } return true; } template::value,int> =0>inline bool _read(T& x){ if(!skip())return false; if(rdLeft+20>=rdRight)reload(); bool neg=false; if(rdbuf[rdLeft]=='-'){ neg=true; rdLeft++; } x=0; while(rdbuf[rdLeft]>='0' and rdLeft::value,int> =0>inline bool _read(T& x){ if(!skip())return false; if(rdLeft+20>=rdRight)reload(); bool neg=false; if(rdbuf[rdLeft]=='-'){ neg=true; rdLeft++; } x=0; while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft='0' and rdbuf[rdLeft]<='9' and rdLeft=rdRight)reload(); x=rdbuf[rdLeft++]; return true; } inline bool _read(string& x){ if(!skip())return false; for(;;){ int pos=rdLeft; while(pos' ')pos++; x.append(rdbuf+rdLeft,pos-rdLeft); if(rdLeft==pos)break; rdLeft=pos; if(rdLeft==rdRight)reload(); else break; } return true; } templateinline bool _read(vector& v){ for(auto& x:v){ if(!_read(x))return false; } return true; } char wtbuf[L],tmp[50]; int wtRight=0; inline void flush(){ fwrite(wtbuf,1,wtRight,stdout); wtRight=0; } inline void _write(const char& x){ if(wtRight>L-32)flush(); wtbuf[wtRight++]=x; } inline void _write(const string& x){ for(auto& c:x)_write(c); } template::value,int> =0>inline void _write(T x){ if(wtRight>L-32)flush(); if(x==0){ _write('0'); return; } else if(x<0){ _write('-'); if (__builtin_expect(x == std::numeric_limits::min(), 0)) { switch (sizeof(x)) { case 2: _write("32768"); return; case 4: _write("2147483648"); return; case 8: _write("9223372036854775808"); return; } } x=-x; } int pos=0; while(x!=0){ tmp[pos++]=char((x%10)|48); x/=10; } rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i]; wtRight+=pos; } templateinline void _write(const vector& v){ rep(i,0,v.size()){ if(i)_write(' '); _write(v[i]); } } public: FastIO(){} ~FastIO(){flush();} inline void read(){} template inline void read(Head& head,Tail&... tail){ assert(_read(head)); read(tail...); } templateinline void write(){if(ln)_write('\n');} template inline void write(const Head& head,const Tail&... tail){ if(space)_write(' '); _write(head); write(tail...); } }; /** * @brief Fast IO */ #line 3 "sol.cpp" #line 2 "library/String/zalgo.hpp" templatevector Zalgo(T& s){ int n=s.size(); vector res(n); for(int i=1,j=0;istruct CHT{ using Line=pair; int n; vector xs; vector ls; CHT(vector& ps):xs(ps){ n=1; while(n<(int)xs.size())n<<=1; xs.resize(n,xs.back()); ls.resize(2*n-1,Line(0,MX)); } T eval(Line& f,T x){return f.first*x+f.second;} void add(T a,T b,int k=0,int L=0,int R=-1){ if(R==-1)R=n; Line f={a,b}; while(L!=R){ int mid=(L+R)>>1; T lx=xs[L],mx=xs[mid],rx=xs[R-1]; Line& g=ls[k]; if(eval(f,lx)=eval(g,lx) and eval(f,rx)>=eval(g,rx))return; if(eval(f,mx)>=1; r>>=1; sz<<=1; } } T getmin(T x){ int k=lower_bound(ALL(xs),x)-xs.begin()+n-1; T res=eval(ls[k],x); while(k){ k=(k-1)>>1; chmin(res,eval(ls[k],x)); } return res; } }; /** * @brief Convex Hull Trick (Li Chao Tree) * @docs docs/lichaotree.md */ #line 7 "sol.cpp" FastIO io; int main(){ string s; io.read(s); int n=s.size(); vector tmp(n+1); iota(ALL(tmp),0); CHT dp(tmp); dp.add(1,0); auto seq=Zalgo(s); set ok; rep(i,1,n)ok.insert(i); ok.insert(inf); map> elem; rep(i,1,n)elem[seq[i]].push_back(i); rep(i,0,n){ for(auto& x:elem[i])ok.erase(x); if(i){ int j=i+1,add=2; for(;;){ j=*ok.lower_bound(j); if(j==inf)break; int val=dp.getmin(j); j+=i+1; if(j>n)break; dp.add_segment(1,val+add-j,j,n+1); add=1; } } // rep(j,0,n+1)io.write(dp.getmin(j),' '); // io.write(); } io.write(dp.getmin(n)); return 0; }