hdu1711-Number Sequence

Number Sequence

坑爹，用c++输入输出又TLE了。

// File Name: hdu1711.cpp
// Author: bo_jwolf
// Created Time: 2013年04月30日 星期二 19:07:27

#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>

using namespace std;
const int maxn = 1000005 ;
int next[ maxn ] ;
int num1[ maxn ] , num2[ maxn ] ;
int m , n ;
int get_next()
{
int j , k ;
next[ 0 ] = -1 ;
j = 0;
k = -1 ;
while( j < m )
{
if( k == -1 || num2[ j ] == num2[ k ] )
{
j++;
k++;
next[ j ] = k ;
}
else
k = next[ k ];
}
}

int KMP_Index()
{
int i = 0 , j = 0 ;
get_next();
while( i < n && j < m )
{
if( j == -1 || num1[ i ] == num2[ j ])
{
i++ ;
j++ ;
}
else
j = next[ j ] ;
}
if( j == m )
return i - m + 1 ;
else
return -1;
}

int main()
{
int Case ;
scanf( "%d" ,&Case );
while( Case-- )
{
scanf( "%d%d" , &n , & m );
for( int i = 0 ; i < n ; i++ )
scanf( "%d" , &num1[ i ] );
for( int i = 0 ; i < m ; i++ )
scanf( "%d" ,&num2[ i ] );
printf( "%d\n" , KMP_Index() ) ;
}
return 0;
}