给定两个数列a和b，任务是找到一个下标K使得a[K], a[K+1], ..., a[K+M-1]与b[1], b[2], ..., b[M]相等。如果存在多个K，输出最小的那个。输入包含测试用例数量T，每个用例包含数列a和b的信息。当没有满足条件的K时，输出-1。这是一个KMP算法的应用问题，将数字替换为字符进行处理。"
116178838,10544823,在Python的Tkinter中使用PhotoImage显示图像的问题与解决,"['Python', 'GUI开发', 'Tkinter', '图像处理']
题目：
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
最低0.47元/天 解锁文章
413
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
