Pagini recente » Cod sursa (job #294179) | Cod sursa (job #1945384) | Cod sursa (job #1455291) | Cod sursa (job #2818777) | Cod sursa (job #3279937)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("pscpld.in");
ofstream fout("pscpld.out");
vector<long long> p;
string s;
string s2; ///stringul prelucrat a#b#c#d#...f#
void manacher(string s){
long long n=s2.length();
p.assign(n,1);
long long l=1, r=1;
for(long long i=1; i<n; ++i){
p[i]=max(1LL,min(r-i, p[l+r-i]));
while(i+p[i]<n && i-p[i]>=0 && s2[i+p[i]]==s2[i-p[i]]){
p[i]++; ///expanding
}
if(i+p[i]>r){
l=i-p[i];
r=i+p[i];
}
}
}
int main()
{
fin >> s;
for(auto i : s){
s2+=string("#")+i;
}
s2+="#";
manacher(s2);
long long ans=0;
for(auto i : p){
ans+=i/2;
}
fout << ans;
return 0;
}