hdu1711 KMP应用之详细讲解

Kmp算法详细看严蔚敏的视频教程很详细很好

NumberSequence

TimeLimit:10000/5000MS(Java/Others)MemoryLimit:32768/32768K(Java/Others)
TotalSubmission(s):5047AcceptedSubmission(s):2275

ProblemDescription

Giventwosequencesofnumbers:a[1],a[2],......,a[N],andb[1],b[2],......,b[M](1<=M<=10000,1<=N<=1000000).YourtaskistofindanumberKwhichmakea[K]=b[1],a[K+1]=b[2],......,a[K+M-1]=b[M].IftherearemorethanoneKexist,outputthesmallestone.

Input

ThefirstlineofinputisanumberTwhichindicatethenumberofcases.Eachcasecontainsthreelines.ThefirstlineistwonumbersNandM(1<=M<=10000,1<=N<=1000000).ThesecondlinecontainsNintegerswhichindicatea[1],a[2],......,a[N].ThethirdlinecontainsMintegerswhichindicateb[1],b[2],......,b[M].Allintegersareintherangeof[-1000000,1000000].

Output

Foreachtestcase,youshouldoutputonelinewhichonlycontainKdescribedabove.IfnosuchKexists,output-1instead.

SampleInput

2

135

1212312313212

12313

135

1212312313212

12321

SampleOutput

6

-1

题意 输入2串数字

第二串数在第一串数中出现的位置

#include<stdio.h>
int a[1000005];
int b[10005];
int next[10005];
int m,n;
void get_next()
{
    int i,j;
    next[1]=0;
    j=0;i=1;
    while(i<m)//不要等于m
    {
        if(j==0||b[i]==b[j]) {i++;j++;next[i]=j;}//这个地方完全可以弄到m所以等于的时候不用继续循环
        else 
            j=next[j]; 
    }
}
int KMP()//注意此函数和get_next可不一样
{
    int i,j;
    next[1]=0;
    i=1;j=1;//这里ij分别是二者的起始位置
    while(i<=n&&j<=m)
    {
        if(j==0||a[i]==b[j]) {i++;j++;}//如果相等则比较下一个  不等就回溯 这里不要再给next数组赋值了上面已经赋好了
        else 
            j=next[j];
    
    }
    if(j>m) return i-m;
    else return -1;
}
int main()
{
      int i,t,ans;
      scanf("%d",&t);
      while(t--)
      {
          scanf("%d %d",&n,&m);
          for(i=1;i<=n;i++)
              scanf("%d",&a[i]);//注意从1开始输入
          for(i=1;i<=m;i++)
              scanf("%d",&b[i]);
          get_next();
          ans=KMP();
          printf("%d\n",ans);
      }
      return 0;
}