Pagini recente » Cod sursa (job #946733) | Cod sursa (job #482954) | Cod sursa (job #524181) | Cod sursa (job #506857) | Cod sursa (job #509894)
Cod sursa(job #509894)
#include <fstream>
#include <vector>
#include <string>
#include <time.h>
using namespace std;
ifstream f("pscpld.in");
ofstream g("pscpld.out");
string s;
long long R[1000010],P[1000010];
long long PP(string s)
{
string x("$"); x+=s; x+='#';
int j=0,ct=1;
unsigned int i=1;
long long s1=0;
while(i<=x.size()-2)
{
while(x[i-j]==x[i+j+1])
j++;
R[ct]=j; ct++; s1+=j;
int k=1;
while (R[i-k] != R[i] - k && k <= j)
{
s1+=(min(R[i-k],R[i]-k)); R[ct]=(min(R[i-k],R[i]-k));
ct++; k++;
}
j=max(j-k,0); i+=k;
}
return s1;
}
long long PG(string s)
{
string x("$"); x+=s; x+='#';
int j=0,ct=1;
unsigned int i=1;
long long s2=0;
while(i<=x.size()-2)
{
while(x[i-j-1]==x[i+j+1])
j++;
P[ct]=j; ct++; s2+=j;
int k=1;
while(P[i-k]!=P[i]-k && k<=j)
{
s2+=(min(P[i-k],P[i]-k)); P[ct]=(min(P[i-k],P[i]-k));
k++; ct++;
}
j=max(j-k,0); i+=k;
}
return s2+x.size()-2;
}
int main(){
f>>s;
long long L=PP(s);
long long M=PG(s);
g<<L+M;
}