Pagini recente » Cod sursa (job #2310148) | Cod sursa (job #2740134) | Cod sursa (job #1076050) | Cod sursa (job #1522002) | Cod sursa (job #2870699)
#include <fstream>
#include <iostream>
#include <string>
using namespace std;
ifstream fin ("pscpld.in");
ofstream fout ("pscpld.out");
string buff, a;
int pal[2000001];
int main()
{
int n, i, l, st, dr;
long long rasp;
fin >> buff;
a += '#';
for (i = 0; i<buff.size(); i++)
{
a += buff[i];
a += '#';
}
n = a.size();
st = dr = -1;
for (i = 0; i<n; i++)
{
if (i <= dr)
l = min (pal[st+dr-i], dr-i+1);
else
l = 1;
while (0 <= i-l && i+l < n && a[i-l] == a[i+l])
l++;
pal[i] = l;
if (i+l-1 > dr)
{
dr = i+l-1;
st = i-l+1;
}
}
rasp = 0;
for (i = 0; i<n; i++)
rasp = rasp + pal[i]/2;
fout << rasp;
return 0;
}