【codevs2183】匹配字符串

KMP裸题

 #include<algorithm>
 #include<iostream>
 #include<cstdlib>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 using namespace std;

 #define N 200010

 char a[N],b[N];
 int p[N],cnt[N];

 int l1,l2,t;
 int x;

 int main()
 {
     scanf("%d%d%d",&l1,&l2,&t);
     scanf("%s%s",a+,b+);
     for (int i=,j=;i<=l2;i++)
     {
         while (j> && b[i]!=b[j+])
             j=p[j];
         if (b[i]==b[j+])
             j++;
         p[i]=j;
     }
     for (int i=,j=;i<=l1;i++)
     {
         while (j> && a[i]!=b[j+])
             j=p[j];
         if (a[i]==b[j+])
             ++j;
         ++cnt[j];
     }
     for (int i=l1;i>;i--)
         cnt[p[i]]+=cnt[i];
     while (t--)
     {
         scanf("%d",&x);
         printf("%d\n",cnt[x]-cnt[x+]);
     }
     return ;
 }