KMP

H - kmp入门3

Time Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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 
       
       

 这应该是最简单的kmp了吧。

#include <stdio.h>
#include <string.h>
int next[10005];
int a1[1000005],b1[10005];
void get_next(int len2)
{
    int i = 0,j = -1;
    next[0] = -1;
    while (i<len2)
    {
        if(j == -1 || b1[i] == b1[j])
        {
            i++;
            j++;
            if (b1[i]!=b1[j])
                next[i] = j;
            else
                next[i] = next[j];
        }
        else
            j = next[j];
    }
}

int kmp(int len1,int len2)
{
    int i=0,j=0;
    get_next(len2);
    while(i<len1)
    {
        if(j==-1||a1[i]==b1[j])
        {
            ++i;
            ++j;
        }
        else
            j=next[j];
        if(j == len2)
        {
            printf("%d\n",i-j+1);
            break;
        }
        
    } 
	if(j<len2)printf("-1\n");
}

int main()
{
    int n;
    scanf("%d",&n);
    while(n--)
    {
    	int aa,bb;
        scanf("%d%d",&aa,&bb);
        for(int i=0;i<aa;i++)
        scanf("%d",&a1[i]);
        for(int i=0;i<bb;i++)
        scanf("%d",&b1[i]);
        kmp(aa,bb);
    }
    return 0;
}

---

All Copyright Reserved 2013-2014  SDJZU ACM TEAM 
Power by HUST Virtual Judge 
Server Time: