Number Sequence ( 数字序列） HDU - 1711

最新推荐文章于 2024-07-18 12:00:00 发布

原创

最新推荐文章于 2024-07-18 12:00:00 发布 · 477 阅读

1 ·

CC 4.0 BY-SA版权

该博客介绍了一个寻找数字序列子串在模串中首次出现位置的问题，提出使用KMP算法进行解决。KMP算法是一种改进的字符串匹配算法，通过预处理模式串得到next数组，减少了匹配过程中模式串的移动次数。当匹配失败时，模式串会根据next数组调整位置。题目提供输入输出格式，并给出样例分析。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 such K exists, output -1 instead.

Sample Input
2
13 5
1 2