KMP模板题 Number Sequence HDU1711

模板...嗯

 #include <iostream>
 #include <cstdio>
 #include <string.h>
 #pragma warning ( disable : 4996 )
 using namespace std;

 const int inf = 0x3f3f3f3f;
 const int maxn = 1e4+;
 const int vspot = 1e6+;

 int net[maxn];
 int num[maxn], test[vspot];
 int N, M, ans;

 void getnext()
 {
     memset( net, , sizeof(net) );
     ans = ;
     int len = M;

     int k = -, j = ;
     net[j] = -;

     while ( j < len- )
     {
         if ( k==- || num[j]==num[k] )
         {
             k++;
             j++;
             net[j] = k;
         }
         else
             k = net[k];
     }
 }

 void solve()
 {
     int i = , j = ;
     while ( i < N && j < M )
     {
         if( j == - || test[i] == num[j] )
         { i++; j++; }
         else
             j = net[j];
     }
     if( j == M )
         ans = i-j+;
     else
         ans = -;
 }

 int main()
 {
     int all;
     cin >> all;
     while (all--)
     {
         cin >> N >> M;
         for( int i = ; i < N; i++ )
             scanf( "%d", &test[i] );
         for( int i = ; i < M; i++ )
             scanf( "%d", &num[i] ); 

         getnext();
         solve();
         printf( "%d\n", ans );
     }
     return ;
 }