hdu1171kmp果题

题目链接：http://icpc.njust.edu.cn/Problem/Hdu/1711/

 #include<bits/stdc++.h>
 using namespace std;
 typedef unsigned int ui;
 typedef long long ll;
 typedef unsigned long long ull;
 #define pf printf
 #define mem(a,b) memset(a,b,sizeof(a))
 #define prime1 1e9+7
 #define prime2 1e9+9
 #define pi 3.14159265
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define scand(x) scanf("%llf",&x)
 #define f(i,a,b) for(int i=a;i<=b;i++)
 #define scan(a) scanf("%d",&a)
 #define dbg(args) cout<<#args<<":"<<args<<endl;
 #define inf 0x3f3f3f3f
 #define maxn 1000010
 int n,m,t;
 int a[maxn],b[maxn],nxt[maxn];
 void getnxt()
 {
     nxt[]=-;
     int i=-,j=;
     while(j<m)
     {
         if(i==-||b[i]==b[j])
         {
             i++,j++;
             if(b[i]==b[j])nxt[j]=nxt[i];
             else nxt[j]=i;
         }
         else i=nxt[i];
     }
 }
 int kmp()
 {
     int i=,j=;
     while(i<n)
     {
         if(j==-||a[i]==b[j])i++,j++;
         else j=nxt[j];
         if(j==m)
         {
             return i-m+;
         }
     }
     return -;
 }
 int main()
 {
     //freopen("input.txt","r",stdin);
     //freopen("output.txt","w",stdout);
     std::ios::sync_with_stdio(false);
     scan(t);
     while(t--)
     {
         scan(n);
         scan(m);
         f(i,,n-)scan(a[i]);
         f(i,,m-)scan(b[i]);
         getnxt();
         pf("%d\n",kmp());
     }
  }