【HDU 3336】Count the string（kmp）

点击打开题目

Count the string Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10886    Accepted Submission(s): 5065 Problem Description 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 6   Author foreverlin@HNU   Source HDOJ Monthly Contest – 2010.03.06   Recommend lcy

题意：给你一个字符串算这里面所有前缀出现的次数和。比如字符串abab，a出现2次，ab出现2次，aba出现1次，abab出现1次。

题解：next数组的值就是记录当前位置向前多少个和这个字符串开头多少个相等，有了这样我们只要记录每个next这对应有多少个，然后加上n个自身的一个匹配就行了。

这个题目的关键还是对kmp的理解，本质上kmp的next就是表示串内关系的一个值。

代码一：

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<cstring>
using namespace std;

const int MAX=200010;

int Next[MAX];
char str[MAX];
int rec[MAX];
int n;

void getNext(){
	int i=0,j=-1;
	Next[0]=-1;
	while(i<n){
		if(j==-1||str[i]==str[j]){
			Next[++i]=++j;
		}
		else
		j=Next[j];
	}
}

int main(){
	int T;
	cin>>T;
	while(T--){
		cin>>n>>str;
		getNext();
		memset(rec,0,sizeof(rec));

		for(int i=1;i<=n;i++)
		rec[Next[i]]++;

		int ans=0;
		for(int i=1;i<=n;i++){
			if(rec[i]>0){
				ans+=rec[i];
				ans%=10007;
			}
		}
		ans+=n;
		cout<<ans%10007<<endl;
	}
	return 0;
}

第二种：假设两串字符完全相等，next[j]=i,代表s[1...i]==sum[j-i+1....j]，这一段其实就是前缀

i~j之间已经不可能有以j结尾的子串是前缀了，不然next【j】就不是 i 了

设dp【i】:以string[i]结尾的子串总共含前缀的数量

所以dp[j]=dp[i]+1，即以i结尾的子串中含前缀的数量加上前j个字符这一前缀

代码二：

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <iostream>
using namespace std;
const int N = 200005;
char a[N];
int next[N],d[N];
void get_next(char *b)
{
    int i = -1, j = 0;
    next[0] = -1;
    int len = strlen(b);
    while(j < len)
    {
        if(i == -1 || b[i] == b[j])
            next[++j] = ++i;
        else
            i = next[i];
    }
}
int main()
{
    int T,i,n;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%s",&n,a);
        get_next(a);
        for(i = 1; i <= n; i ++)
            d[i] = 1;
        d[0] = 0;
        int sum = 0;
        for(i = 1; i <= n; i ++)
        {
            d[i] = d[next[i]] + 1;
            sum += d[i]%10007;
        }
        printf("%d\n",sum%10007);
    }
    return 0;
}