hdu 5918 Sequence I kmp算法

Sequence I

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

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
  
  

 

Source

2016中国大学生程序设计竞赛（长春）-重现赛

//CcpcTraining.cpp: 定义控制台应用程序的入口点。
//#include "stdafx.h"
#include<stdio.h>
#define size 1<<20
int a[size], b[size];
int nextval[size];
int n, m, p;
void getNextval() {
    int k = -1;
    int j = 0;
    nextval[j] = k;
    while (j < m) {
        if ((k == -1) || (b[j] == b[k])) {
            ++k;
            ++j;
            nextval[j] = k;
        }
        else {
            k = nextval[k];
        }
    }
}

int kmp(int temp[],int length) {
    int i = 0, j = 0;
    int sum = 0;
    while (i < length) {
        if ((j == -1) || temp[i] == b[j]) {
            i++;
            j++;
            if (j == m) {
                sum++;
                j = nextval[j];
            }
        }
        else {
            j = nextval[j];
        }
    }    
    return sum;
}

int main() {
    int test;
    scanf("%d", &test);
    for (int t = 1; t <= test; t++) {
        scanf("%d%d%d", &n, &m, &p);
        for (int i = 0; i < n; i++) {
            scanf("%d", &a[i]);
        }
        for (int i = 0; i < m; i++) {
            scanf("%d", &b[i]);
        }
        getNextval();
        int sum = 0;
        for (int i = 0; i < p; i++) {
            int index = 0;
            int temp[size];
            for (int j = i; j < n&&i + (m - 1)*p < n; j += p) {
                temp[index++] = a[j];
            }
            sum += kmp(temp,index);
        }
        printf("Case #%d: %d\n", t, sum);
    }
    return 0;
}