Pagini recente » Cod sursa (job #1110095) | Cod sursa (job #1760457) | Cod sursa (job #2262933) | Cod sursa (job #2798271) | Cod sursa (job #3041047)
#include <fstream>
#include <string>
using namespace std;
ifstream in ("pscpld.in");
ofstream out ("pscpld.out");
const long long max_size = 2e6 + 1;
long long p[max_size];
signed main ()
{
string v, s;
in >> v;
s += '$';
for (long long i = 0; i < v.size(); i++)
{
s += v[i];
s += '$';
}
long long n = v.size() * 2, poz = 0, dr = 0, ans = 0;
for (long long i = 1; i < n; i++)
{
long long x = 2 * poz - i;
if (dr > i)
{
p[i] = min(dr - i, p[x]);
}
while (i >= p[i] + 1 && i + p[i] + 1 <= n && s[i + p[i] + 1] == s[i - p[i] - 1])
{
p[i]++;
}
if (i + p[i] > dr)
{
poz = i;
dr = i + p[i];
}
if (i % 2 == 1)
{
ans += (p[i] + 1) / 2;
}
else
{
ans += p[i] / 2;
}
}
out << ans;
in.close();
out.close();
return 0;
}