A - Number Sequence

最新推荐文章于 2024-07-25 20:50:45 发布

囧九

最新推荐文章于 2024-07-25 20:50:45 发布

阅读量806

点赞数

分类专栏： KMP

本文链接：https://blog.csdn.net/qq_32193741/article/details/80377316

版权

KMP 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

source

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

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 +100;
int n, m;
int P[10100];
int S[N];
void GetNextval(int *P, int nextval[])
{
    int p_len = m;
    int i = 0;   // P 的下标
    int j = -1;
    nextval[0] = -1;

    while (i < p_len)
    {
        if (j == -1 || P[i] == P[j])
        {
            i++;
            j++;

            if (P[i] != P[j])
                nextval[i] = j;
            else
                nextval[i] = nextval[j];  // 既然相同就继续往前找真前缀
        }
        else
            j = nextval[j];
    }
}
int KMP(int *S, int *P, int next[])
{
    GetNextval(P, next);

    int i = 0;  // S 的下标
    int j = 0;  // P 的下标
    int s_len = n;
    int p_len = m;

    while (i < s_len && j < p_len)
    {
        if (j == -1 || S[i] == P[j])  // P 的第一个字符不匹配或 S[i] == P[j]
        {
            i++;
            j++;
        }
        else
            j = next[j];  // 当前字符匹配失败，进行跳转
    }

    if (j == p_len)  // 匹配成功
        return i - j + 1;

    return -1;
}
int main(){
    int next[10100];
    int t;
    scanf("%d", &t);
    while(t--){
        scanf("%d%d", &n, &m);
        for(int i = 0; i <= n - 1; i++){
            scanf("%d", &S[i]);
        }
        for(int i = 0; i <= m - 1; i++){
            scanf("%d", &P[i]);
        }
//        int x = KMP(S, P, next);
        if(n < m)printf("-1\n");
        else printf("%d\n", KMP(S, P, next));
    }
    return 0;
}