hdu 1711 Number Sequence(kmp)
来源:互联网 发布:材料 光电 考研 知乎 编辑:程序博客网 时间:2024/05/20 04:13
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <set>#include <map>#include <string>#include <math.h>#include <stdlib.h>#include <time.h>using namespace std;const int N=1000000+5;const int M=10000+5;int n,m,t[N],p[M],f[M];int kmp(){ int i,j,k=0; f[0]=0; f[1]=0; for(i=1;i<m;i++) { j=f[i]; while(j&&p[i]!=p[j]) j=f[j]; f[i+1]=p[i]==p[j]?j+1:0; } j=0; for(i=0; i<n; i++) { while(j&&p[j]!=t[i]) j=f[j]; if(p[j]==t[i]) j++; if(j==m) { k=1; break; } } if(k) return i-m+2; else return -1;}int main(){ int _,i; scanf("%d",&_); while(_--) { scanf("%d%d",&n,&m); for(i=0; i<n; i++) scanf("%d",&t[i]); for(i=0; i<m; i++) scanf("%d",&p[i]); int p=kmp(); printf("%d\n",p); } return 0;}
0 0
- HDU 1711 Number Sequence(kmp)
- HDU 1711 Number Sequence (kmp)
- hdu 1711 Number Sequence--KMP
- hdu kmp 1711 Number Sequence
- HDU 1711 Number Sequence (KMP)
- HDU 1711Number Sequence(KMP)
- Hdu 1711 KMP Number Sequence
- HDU 1711 Number Sequence KMP
- [HDU 1711]Number Sequence[kmp]
- 【KMP】hdu 1711 Number Sequence
- 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)
- KMP & hdu 1711 Number Sequence
- hdu 1711 Number Sequence(kmp)
- hdu 1711 Number Sequence(kmp)
- [noip2008]双栈排序
- vbs经典回顾之[键盘输入方法]wshShell.SendKeys
- 网上商城之购物车的3种实现方式
- 动态绑定
- hdu 1007 Quoit Design
- hdu 1711 Number Sequence(kmp)
- quick-cocos2d-x 脚本和资源加密
- leetcode: Contains Duplicate II
- 正则表达式、反射
- poj解题报告——1350
- 骑士cms最新全局SQL注入(官方奇葩修复案例)
- 取消进程释放资源
- HTTP与HTTPS的区别
- hdu 1711 Number Sequence(kmp)