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 1 2 3 1 2 3 1 3 2 1 2
1 2 3 1 3
13 5
1 2 1 2 3 1 2 3 1 3 2 1 2
1 2 3 2 1
Sample Output
6
-1
网上找来的kmp模板:
public static void setPrefix(int m) {
int j = 0, k = -1;
next[0] = -1;
while (j < m) {
if (k == -1 || p[j] == p[k]) {
j++;
k++;
next[j] = k;
} else
k = next[k];
}
}
public static int KMP(int n, int m) {
int i = 0, j = 0;
setPrefix(m);
while (i < n) {
if (j == -1 || s[i] == p[j]) {
i++;
j++;
} else
j = next[j];
if (j == m)
return i - m + 1;
}
return -1;
}
暂时还没懂-1是什么黑科技原理….不过看代码应该是一种规避匹配时数组超限的特技。然后是我在网上看视频学了kmp之后自己写出来的:
public static void setPrefix(int m) {
int i = 1;
while (i < m) {
if (p[i] == p[next[i - 1]]) {
next[i] = next[i - 1] + 1;
}
i++;
}
}
public static int KMP(int n, int m) {
int i = 0;
int j = 0;
setPrefix(m);
while (i < n) {
if (s[i] == p[j]) {
i++;
j++;
} else if (j != 0) {
j = next[j - 1];
}else {
i++;
}
if (j == m) {
return i - m + 1;
}
}
return -1;
}
虽然网上都说前缀数组存的是前后缀匹配的长度,但是我研究了一下依稀有一种感觉就是,每个匹配串的i所对应的第i-1个next数组数其实存的是i数对应前缀的索引(拗口爆),而且在模式匹配的时候网上模板里那句j = next[j]也明显的体现了这种思路。然后我就试着人肉cpu了一下,发现直接从next[i-1]取数字的结果和用i、j俩指针的结果是一样的!然后提交…就ac了,不知道网上有没有我这种操作….
嗯,我感觉还要优化一下,达成一下错位,不然匹配的时候就会有一串if else,完全不如网上模板那么优美。
顺便,Java的数组里是有默认值0的,所以可以无视填0(前后缀不匹配时)的操作,直接i++。
还是自己写的模板好理解….多刷点题巩固一下看看能不能有优化的思路,能让kmp()方法里的else少一个我就满足了。
还有一条定理不明觉厉:假设S的长度为len,则S存在循环子串,当且仅当,len可以被len - next[len]整除,最短循环子串为S[len - next[len]]。
先….先会用。