Pagini recente » Cod sursa (job #2549828) | Cod sursa (job #310421) | Cod sursa (job #1873884) | Cod sursa (job #2321141) | Cod sursa (job #1856836)
#include <fstream>
#include <vector>
#include <cstring>
#define ll long long
#define LL long long
using namespace std;
ifstream fin("pscpld.in");
ofstream fout("pscpld.out");
char s[2000005],t[1000005];
int n,i,j,maxi,idx,l[3000000],rasp;
int main ()
{
fin.get(t,1000005);
s[0] = '$';
int m = strlen(t);
for(i = 0; i < m;i++)
{
n++;
s[n] = t[i];
n++;
s[n] = '$';
}
for(i = 1; i <= n; i++)
{
if(i <= maxi)
l[i] = min(maxi - i, l[idx * 2 - i]);
while(l[i] + 1 + i <= n && i - l[i] - 1 >= 0 && s[ l[i] + i + 1 ] == s[ i - l[i] - 1 ])
l[i]++;
if(l[i] + i > maxi)
maxi = l[i] + i, idx = i;
rasp += (l[i] + 1) / 2;
}
fout<<rasp;
return 0;
}