模板 kmp算法 hdu 1711 Number Sequence

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 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
void build_next(void)
{
    int j=0;
    int t=N[0]=-1;
    while(j<m-1)
        if(0>t||b[j]==b[t])
        {
            j++;
            t++;
            N[j]=(b[j]!=b[t]?t:N[t]);
        }
        else
            t=N[t];
}
int match(void)
{
    int i=0,j=0;
    while((j<m)&&(i<n))
    {
        if((0>j)||a[i]==b[j])
        {
            i++;
            j++;
        }
        else
            j=N[j];
    }
    return i-j;
}