2016 ccpc长春现场赛I Sequence I(hdu 5918)
Sequence I
Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
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).
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
思路：现场赛的时候这道题可以暴力O（n*m）过的，但估计这道题想考的是kmp，把kmp模板改一下就好了，kmp的时间复杂度是O（n），别问我为什么暴力比kmp速度更快。下面给代码
#include
#include