It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example:
s: "abab"
The prefixes are: "a", "ab", "aba", "abab"
For each prefix, we can count the times it matches in s. So we can see that prefix "a" matches twice, "ab" matches twice too, "aba" matches once, and "abab" matches once. Now you are asked to calculate the sum of the match times for all the prefixes. For "abab", it is 2 + 2 + 1 + 1 = 6.
The answer may be very large, so output the answer mod 10007.
s: "abab"
The prefixes are: "a", "ab", "aba", "abab"
For each prefix, we can count the times it matches in s. So we can see that prefix "a" matches twice, "ab" matches twice too, "aba" matches once, and "abab" matches once. Now you are asked to calculate the sum of the match times for all the prefixes. For "abab", it is 2 + 2 + 1 + 1 = 6.
The answer may be very large, so output the answer mod 10007.
Input The first line is a single integer T, indicating the number of test cases.
For each case, the first line is an integer n (1 <= n <= 200000), which is the length of string s. A line follows giving the string s. The characters in the strings are all lower-case letters.
Output For each case, output only one number: the sum of the match times for all the prefixes of s mod 10007. Sample Input
1 4 ababSample Output
6
题意:给你一串字符串,求字符串的所有前缀出现的次数和。
思路:还是next数组的运用,next数组的含义是前后缀相同的最大长度,那么我们只需要求得next数组后遍历数组,若其值大于0,说明存在前缀等于后缀的情况,说明前缀出现过一次,那么就让ans++即可。
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<iostream>
using namespace std;
const int N=200000+10;
const int mod=10007;
int net[N],n,cnt[N];
char a[N];
void getnext()
{
net[0]=-1;
int k=-1,j=0;
while(j<n)
{
if(k==-1||a[j]==a[k])
net[++j]=++k;
else k=net[k];
}
}
int main()
{
int t,ans;
scanf("%d",&t);
while(t--)
{
memset(cnt,0,sizeof(cnt));
scanf("%d%s",&n,a);
getnext();
ans=n;
for(int i=1;i<=n;i++)
if(net[i]) ans=(ans+1)%mod;
printf("%d\n",ans%mod);
}
}