29 lines
466 B
C++
29 lines
466 B
C++
#include<cstdio>
|
|
#include<algorithm>
|
|
using namespace std;
|
|
const int maxn=1e6+5;
|
|
int n,nxt[maxn]; char a[maxn]; long long res=0;
|
|
int main()
|
|
{
|
|
#ifdef local
|
|
freopen("pro.in","r",stdin);
|
|
#endif
|
|
scanf("%d%s",&n,a+1);
|
|
nxt[1]=0;
|
|
for(int i=2,j=0;i<=n;i++)
|
|
{
|
|
while(j&&a[i]!=a[j+1]) j=nxt[j];
|
|
if(a[i]==a[j+1]) j++;
|
|
nxt[i]=j;
|
|
}
|
|
for(int i=2;i<=n;i++)
|
|
{
|
|
int j=i;
|
|
while(nxt[j]) j=nxt[j];
|
|
if(nxt[i]) nxt[i]=j;
|
|
res+=i-j;
|
|
}
|
|
printf("%lld\n",res);
|
|
return 0;
|
|
}
|