Pagini recente » Cod sursa (job #2259497) | Cod sursa (job #1559736) | Cod sursa (job #632074) | Cod sursa (job #1801597) | Cod sursa (job #2590803)
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
using namespace std;
typedef long long ll;
int p[2000005];
ll Manacher(string s)
{
ll rez = 0;
int lg = s.size();
int l = 0,r = -1;
for(int i = 0; i < lg; i++)
{
int k = 0;
if(i > r)
{
k = 1;
}
else
{
k = min(p[r - i + l], r - i + 1);
}
while(i - k >= 0 && i + k < lg && s[i - k] == s[i + k])
k++;
k--;
p[i] = k;
if(i + k > r)
{
r = i + k;
l = i - k;
}
rez += 1LL * (p[i] + 1) / 2;
}
return rez;
}
int main()
{
int i;
ifstream cin("pscpld.in");
ofstream cout("pscpld.out");
ios_base::sync_with_stdio(false);
cin.tie(0);
string a,s = "";
cin >> a;
s += "#";
for(i = 0; i < a.size(); i++)
{
s += a[i];
s += "#";
}
ll rez = 0;
int lg = s.size();
int l = 0,r = -1,k;
for( i = 0; i < lg; i++)
{
if(i > r)
{
k = 1;
}
else
{
k = min(p[r - i + l], r - i + 1);
}
while(i - k >= 0 && i + k < lg && s[i - k] == s[i + k])
k++;
k--;
p[i] = k;
if(i + k > r)
{
r = i + k;
l = i - k;
}
rez += 1LL * (p[i] + 1) / 2;
}
cout << rez;
return 0;
}