Pagini recente » Cod sursa (job #3169215) | Cod sursa (job #1670237) | Cod sursa (job #1113230) | Cod sursa (job #3158177) | Cod sursa (job #2954127)
#include <bits/stdc++.h>
using namespace std;
ifstream f("pscpld.in");
ofstream g("pscpld.out");
const int nmax = 1e6;
int manacher[2*nmax+3];
int st,dr,n,r;
long long sol=1;
string cuv;
char s[2*nmax+3];
int main()
{
f>>cuv;
n=cuv.length();
for(int i=0; i<2*n; i++)
{
if(i%2==0) s[i]='#';
else s[i]=cuv[i/2];
}
manacher[1]=1;
st=1;
dr=2;
for(int i=2; i<2*n; i++)
{
r = min( manacher[st-(i-st)], max(dr-i,0)) ;
while(i+r<2*n && i>r && s[i+r+1] == s[i-r-1])
{
r++;
}
if(i+r>dr) st=i, dr=i+r;
manacher[i]=r;
sol+=r/2+i%2;
}
g<<sol;
}