HDOJ 5918 Sequence I(KMP)

Sequence I

Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
 Total Submission(s): 465    Accepted Submission(s): 180

Problem Description

Mr. Frog has two sequences  a1,a2,⋯,an  and  b1,b2,⋯,bm  and a number p. He wants to know the number of positions q such that sequence  b1,b2,⋯,bm  is exactly the sequence  aq,aq+p,aq+2p,⋯,aq+(m−1)p  where  q+(m−1)p≤n  and  q≥1 .

 

Input

The first line contains only one integer  T≤100 , which indicates the number of test cases.

Each test case contains three lines.

The first line contains three space-separated integers  1≤n≤106,1≤m≤106  and  1≤p≤106 .

The second line contains n integers  a1,a2,⋯,an(1≤ai≤109) .

the third line contains m integers  b1,b2,⋯,bm(1≤bi≤109) .

 

Output

For each test case, output one line “Case #x: y”, where x is the case number (starting from 1) and y is the number of valid q’s.

 

Sample Input

  
  

   
   2
6 3 1
1 2 3 1 2 3
1 2 3
6 3 2
1 3 2 2 3 1
1 2 3
  
  

 

Sample Output

  
  

   
   Case #1: 2
Case #2: 1
  
  

 

题意：有两个序列，a1~an与b1~bm。 给出p，问在a1~an中有几个q能满足  b1==aq  b2==bq+p  b3==bq+2p  

bm==aq+(m-1)p  ?

题解：典型的模式串匹配问题，和kmp模板不同的地方就是每隔p个距离查找一次， 而然要查找出所有满足条件的模式串， 就要进行p次匹配。  例如第一次匹配为  1 ，1+p， 1+2*p.....    第二次匹配为  2， 2+p， 2+2*p....  第p次匹配就是 p， 2*p， 3*p .....

代码如下：

#include<cstdio>
#include<cstring>
using namespace std;
const int N=1e6+5;
int n,m,p,next[N],a[N],b[N];
void getnext()
{
    int i=0,j=-1;
    next[i]=j;
    while(i<m)
    {
        if(j==-1||b[i]==b[j])
        {
            i++;
            j++;
            next[i]=j;
        }
        else
            j=next[j];
    }
}
int kmp()
{
    int res=0;
    getnext();
    for(int k=0;k<p;++k){//进行p次匹配 
        int i=k,j=0;
        while(i<n)
        {
            if(j==-1||a[i]==b[j])
            {
                i+=p;//在母串上每隔p个位置匹配一次 
                j++;
                if(j==m)
                	res++;
            }
            else
                j=next[j];
        }
    }
    return res;
}
int main()
{
    int T;
    scanf("%d",&T);
    for(int kase=1;kase<=T;kase++)
    {
        scanf("%d%d%d",&n,&m,&p);
        memset(next,0,sizeof(next));
        memset(b,0,sizeof(b));//注意要清空b数组，这里WA了两发，迷之耽误一个小时 
        memset(a,0,sizeof(a));
        for(int i=0;i<n;i++)scanf("%d",&a[i]);
        for(int i=0;i<m;i++)scanf("%d",&b[i]);
        printf("Case #%d: %d\n",kase,kmp());
    }
    return 0;
}