标签：hdu1711 number sequence kmp
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
6 -1
#include <stdio.h>
#define M 10100
#define N 1000100
int a[N] , b[M] ;
int next[M] ;
void getNext(int m)
{
int i = -1 , j = 0;
next[0] = -1 ;
while(j<m)
{
if(i == -1 || b[i] == b[j])
{
++i,++j;
next[j] = i ;
}
else
{
if(b[i] == b[next[i]])
i = next[next[i]] ;
else
i = next[i] ;
}
}
}
int main()
{
int t ;
scanf("%d",&t) ;
while(t--)
{
int n , m ;
scanf("%d%d",&n,&m);
for(int i = 0 ; i < n ; ++i)
{
scanf("%d",&a[i]) ;
}
for(int i = 0 ; i < m ; ++i)
{
scanf("%d",&b[i]) ;
}
getNext(m) ;
int i=0 , j=0 ;
while(i<n&&j<m)
{
if(j == -1 || a[i] == b[j])
{
++i , ++j ;
}
else
{
j = next[j] ;
}
}
if(j == m)
{
printf("%d\n",i-m+1) ;
}
else
{
puts("-1") ;
}
}
return 0 ;
}hdu 1711 Number Sequence KMP模板题~~~
标签：hdu1711 number sequence kmp
原文地址：http://blog.csdn.net/lionel_d/article/details/44851329
