Pagini recente » Cod sursa (job #1806155) | Cod sursa (job #650153) | Cod sursa (job #2751345) | Cod sursa (job #894750) | Cod sursa (job #1203921)
#include <fstream>
#include <cstring>
using namespace std;
#define NMax 1000050
ifstream f("pscpld.in");
ofstream g("pscpld.out");
char S[2*NMax];
int Slung;
char ch;
int n;
int Pi[2*NMax];
unsigned long long sol;
int main()
{
int i;
S[0]='a'-1;
S[1]='#';
Slung=1;
while(f>>ch)
{
S[++Slung]=ch;
S[++Slung]='#';
}
S[Slung+1]='a'-2;
S[Slung+2]='\0';
n=Slung;
int L,R,C,p,d;
L=R=C=0;
for(i=1;i<=n;i++)
{
if(i>R)
{
p=1;
while(S[i-p]==S[i+p]) p++;
p--;
Pi[i]=(p<<1)|1;
L=i-p,R=i+p,C=i;
}
else
{
d=i-C;
if(C-d-Pi[C-d]/2<L) p=C-d-L+1;
else p=Pi[C-d]/2+1;
while(S[i-p]==S[i+p]) p++;
p--;
Pi[i]=(p<<1)|1;
if(i+Pi[i]/2>R) L=i-p,R=i+p,C=i;
}
}
for(i=1;i<=n;i++)
{
sol+=((long long)Pi[i]-2)/4;
if(Pi[i]>=3) sol+=1LL;
}
g<<sol<<"\n";
f.close();
g.close();
return 0;
}