HDU1711 Number Sequence(裸KMP)
2017-05-04 11:25
260 查看
一道裸的KMP题,用模板直接上就行
#include <iostream>
#include <cstdio>
using namespace std;
int Next[10005],a[1000000+5],b[10000+5];
int i,j,n,m;
void getNext()
{
Next[1] = 0;Next[0] =0;
for(i = 1;i<m;i++)
{
j = Next[i];
while(j&&b[i]!=b[j])j = Next[j];
if(b[i] == b[j])Next[i+1] = j+1;
else Next[i+1] = 0;
}
}
void find()
{
getNext();
int i;
int j = 0;
for(i = 0;i<n;i++)
{
while(j&&a[i]!=b[j]){j = Next[j];}
if(a[i] == b[j])j++;
if(j == m){printf("%d\n",i-m+2);return;}
}
cout<<"-1"<<endl;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
cin>>n>>m;
for(i = 0;i<n;i++)
scanf("%d",&a[i]);
for(i = 0;i<m;i++)
scanf("%d",&b[i]);
getNext();
find();
}
return 0;
}
#include <iostream>
#include <cstdio>
using namespace std;
int Next[10005],a[1000000+5],b[10000+5];
int i,j,n,m;
void getNext()
{
Next[1] = 0;Next[0] =0;
for(i = 1;i<m;i++)
{
j = Next[i];
while(j&&b[i]!=b[j])j = Next[j];
if(b[i] == b[j])Next[i+1] = j+1;
else Next[i+1] = 0;
}
}
void find()
{
getNext();
int i;
int j = 0;
for(i = 0;i<n;i++)
{
while(j&&a[i]!=b[j]){j = Next[j];}
if(a[i] == b[j])j++;
if(j == m){printf("%d\n",i-m+2);return;}
}
cout<<"-1"<<endl;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
cin>>n>>m;
for(i = 0;i<n;i++)
scanf("%d",&a[i]);
for(i = 0;i<m;i++)
scanf("%d",&b[i]);
getNext();
find();
}
return 0;
}
相关文章推荐
- HDU 1711 Number Sequence(KMP模板)
- Hdu1711-Number Sequence-【KMP】
- Number Sequence(HDU 1711 KMP)
- HDU - 1711 Number Sequence(KMP)
- HDU 1711 Number Sequence (KMP)
- HDU 1711 Number Sequence (kmp)
- hdu 1711 Number Sequence KMP 基础题
- HDU 1711 Number Sequence (kmp)
- HDU 1711 Number Sequence(KMP)
- hdu 1711 Number Sequence--KMP
- HDU 1711 Number Sequence(KMP)
- HDU1711 ——Number Sequence(KMP模板题)
- hdu 1711 Number Sequence(kmp模板题)
- HDU 1711 Number Sequence(KMP模板)
- HDU-#1711 Number Sequence(KMP)
- HDU 1711 Number Sequence(KMP)
- hdu 1711 Number Sequence(很简单的KMP)
- HDU 1711 Number Sequence(kmp)
- Number Sequence - HDU 1711(KMP模板题)
- HDU 1711 Number Sequence (KMP)