1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <iostream>
#include "message.h"
#include "palindromy.h"
using namespace std;
int wyn[10000002];
/*int MyNodeId()
{
	return 0;
}
int GetLength()
{
	int n;
	cin >> n;
	return n;
}
string slo="";
int initi=0;
void init()
{
	if (initi==1)
		return;
	initi=1;
	cin >> slo;
}
char GetLetter(int i)
{
	init();
	return slo[i];
}*/
int main()
{
	if (MyNodeId()!=0)
		return 0;
	int n=GetLength();
	long long totwyn=0;
	for (int i=0; i<n; i++)
	{
	    int czy=0;
		while (i-wyn[i]-1>=0 && i+wyn[i]+1<n && GetLetter(i-wyn[i]-1)==GetLetter(i+wyn[i]+1))
        {
			wyn[i]++;
			czy=1;
        }
        totwyn+=wyn[i]+1;
        if (czy==0)
            continue;
        for (int j=1; j<wyn[i]; j++)
        {
            if (i-j-wyn[i-j]==i-wyn[i])
            {
                wyn[i+j]=wyn[i-j];
                break;
            }
            else
                wyn[i+j]=min(wyn[i-j], wyn[i]-j);
        }
		//cout << i << " " << wyn[i]+1 << "\n";
	}
	for (int i=0; i<n; i++)
		wyn[i]=0;
	for (int i=0; i<n-1; i++)
	{
		int czy=0;
		while (i-wyn[i]>=0 && i+wyn[i]+1<n && GetLetter(i-wyn[i])==GetLetter(i+wyn[i]+1))
        {
			wyn[i]++;
			czy=1;
        }
        totwyn+=wyn[i];
        if (czy==0)
            continue;
		for (int j=1; j<wyn[i]; j++)
        {
            if (i-j-wyn[i-j]==i-wyn[i])
            {
                wyn[i+j]=wyn[i-j];
                break;
            }
            else
                wyn[i+j]=min(wyn[i-j], wyn[i]-j);
        }
		//cout << i << " " << wyn[i] << "\n";
	}
	cout << totwyn;
	return 0;
}