kmp“看毛片”算法模板题

最新推荐文章于 2020-07-09 19:42:44 发布

cdqzgxxqdql

最新推荐文章于 2020-07-09 19:42:44 发布

阅读量1.2w

点赞数

分类专栏：历程 KMP 文章标签：历程 kmp 算法

本文链接：https://blog.csdn.net/cdqzgxxqdql/article/details/52760434

版权

本文介绍了如何使用KMP算法解决在给定数列A中查找数列B首次出现的位置的问题。通过给出的HDU1711题目实例，详细解释了算法的应用过程，包括构建next数组来存储位移信息。当找不到数列B时，输出-1。

摘要由CSDN通过智能技术生成

kmp“看毛片”算法模板题

HDU1711

Problem Description
Given two sequences of numbers : a[1], a[2], …… , a[N], and b[1], b[2], …… , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], …… , a[K + M - 1] = b[M]. If there are more than one K exist, output the smallest one.

Input
The first line of input is a number T which indicate the number of cases. Each case contains three lines. The first line is two numbers N and M (1 <= M <= 10000, 1 <= N <= 1000000). The second line contains N integers which indicate a[1], a[2], …… , a[N]. The third line contains M integers which indicate b[1], b[2], …… , b[M]. All integers are in the range of [-1000000, 1000000].

Output
For each test case, you should output one line which only contain K described above. If no