Number Sequence
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9148 Accepted Submission(s): 4180
#include <iostream>
using namespace std;
const int MAXN = 1000005;
const int MAXM = 10005;
int text[MAXN]; /*文本串*/
int next[MAXM]; /*next數組*/
int pattern[MAXM];/*模式串*/
int m,n,t;
/*O(m)的時間求next數組*/
void get_next(){
int i=0,j=-1;
next[i]=j;
while(i<m){
if(j==-1 || pattern[i]==pattern[j]){
i++; j++;
next[i]=j;
}else
j = next[j];
}
}
/*o(n)的時間進行匹配*/
//void kmp(){
// int i=0, j=0;
// while(i<n && j<m){
// if(j==-1 || text[i]==pattern[j]){
// i++;
// j++;
// }else
// j=next[j];
// }
// if(j>=m) cout<<i-j+1<<endl;
// else cout<<-1<<endl;
//}
void kmp(){
int j=0;
for(int i=0; i<n; i++){
while(j && text[i]!=pattern[j]) j=next[j];
if(text[i]==pattern[j]) j++;
if(j==m) {
cout<<i-m+2<<endl;
return;
}
}
cout<<-1<<endl;
}
int main()
{
cin>>t;
while(t--){
cin>>n>>m;
for(int i=0; i<n; i++) cin>>text[i];
for(int i=0; i<m; i++) cin>>pattern[i];
get_next();
kmp();
}
}