1.
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
char s[1123456];
char t[1123456];
int ne[1234566];
void getnext(char *str, int len)
{
ne[0] = -1;
int k = -1;
for(int i=1;i<len;i++)
{
while(k>-1 && str[i] != str[k+1]) k = ne[k];
if(str[i] == str[k+1]) k++;
ne[i] = k;
}
}
int KMP(char *str, int l1, char *ptr, int l2)
{
int k = -1;
getnext(ptr, l2);
for(int i=0;i<l1;i++)
{
while(k>-1 && str[i]!=ptr[k+1]) k = ne[k];
if(str[i] == ptr[k+1]) k++;
if(k==l2-1)
{
return i-l2+2;
}
}
return -1;
}
int main()
{
while(scanf("%s",s)!=EOF)
{
scanf("%s",t);
int ans = KMP(s,strlen(s),t,strlen(t));
cout<<ans<<endl;
}
return 0;
}
2.
const int MAXN=1000000+10;
int a[MAXN],b[MAXN];
int next[MAXN];
int l1,l2;
void get_next()
{
int i=0,j=-1;
next[0]=-1;
while(i<l2)
{
if(j==-1||b[i]==b[j])next[++i]=++j;
else j=next[j];
}
}
int kmp()
{
int i=0,j=0;
int l,r;
while(i<l1)
{
if(j==-1||a[i]==b[j])
{
++i;
++j;
}
else j=next[j];
if(j==l2)
{
return i-l2+1;
}
}
return -1;
}