HDU - 3336 Count the string [KMP]

最新推荐文章于 2022-10-26 15:00:00 发布

Wangzning_

最新推荐文章于 2022-10-26 15:00:00 发布

阅读量192

点赞数

分类专栏： KMP 文章标签： KMP

本文链接：https://blog.csdn.net/Prince_NYing/article/details/87183502

版权

KMP 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

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.

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
abab

Sample Output

题意

给你一个字符串s，问你其前缀字符串在s中出现了多少次，利用next数组的特性，从1->n遍历，获取next值，然后不断向前回溯（从当前子串中找存在的前缀子串）直到0，循环的的次数加上串长就是最后的结果。

AC代码

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
#include<string>
#include<map>
#define INF 0x3f3f3f3f
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define fori(x) for(int i=0;i<x;i++)
#define forj(x) for(int j=0;j<x;j++)
#define memset(x,y) memset(x,y,sizeof(x))
#define memcpy(x,y) memcpy(x,y,sizeof(y))
#define sca(x) scanf("%d", &x)
#define scas(x) scanf("%s",x)
#define sca2(x,y) scanf("%d%d",&x,&y)
#define sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define scl(x) scanf("%lld",&x)
#define scl2(x,y) scanf("%lld%lld",&x,&y)
#define scl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z)
#define pri(x) printf("%d\n",x);
#define pri2(x,y) printf("%d %d\n",x,y)
#define pris(x) printf("%s\n",x)
#define prl(x) printf("%lld\n",x)
//#include <bits/stdc++.h>
typedef long long ll;
const int maxn=1e6+7;
const int mod=10007;
const double eps=1e-8;

using namespace std;

char s[maxn];
int nextval[maxn];

void getnext(char *s, int len)
{
	int i = 0, j = -1;
	nextval[0] = -1;
	while(i != len)
	{
		if(j == -1 || s[i] == s[j])
			nextval[++i] = ++j;
		else
			j = nextval[j];
	}
}

int main()
{
  int t;
  sca(t);
  while(t--)
  {
    int n;
    sca(n);
    scas(s);
    getnext(s,n);
    int sum = n;
    rep(i,1,n+1)
    {
      int pos = nextval[i];
      while(pos)
      {
        sum = (sum+1)%mod;
        pos = nextval[pos];
      }
    }
    pri(sum)
  }
  return 0;
}