标签:
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 17971 Accepted Submission(s): 7854
#include<cstdio> #include<cstring> using namespace std; const int MAXN=1000005; int a[MAXN],b[MAXN],next[MAXN]; int lena,lenb; void getnext() { int i=0,j=-1; next[0]=-1; while(i<lenb) { if(j==-1||b[i]==b[j]) { i++; j++; next[i]=j; } else j=next[j]; } } int KMP() { getnext(); int i=0,j=0; while(i<lena&&j<lenb) { if(j==-1||a[i]==b[j]) { i++; j++; } else j=next[j]; } if(j==lenb) return i-j+1; else return -1; } int main() { int T; scanf("%d",&T); while(T--) { memset(next,0,sizeof(next)); scanf("%d%d",&lena,&lenb); for(int i=0;i<lena;i++) scanf("%d",&a[i]); for(int i=0;i<lenb;i++) scanf("%d",&b[i]); printf("%d\n",KMP()); } return 0; }
标签:
原文地址:http://www.cnblogs.com/program-ccc/p/5197425.html