HDU-1711 Number Sequence kmp算法
来源:互联网 发布:淘宝优惠券返利网 编辑:程序博客网 时间:2024/05/22 13:22
题目链接
http://acm.hdu.edu.cn/showproblem.php?pid=1711
题目
Number Sequence
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 32182 Accepted Submission(s): 13497
Problem Description
Given two sequences of numbers : a[1], a[2], …… , a[N], and b[1], b[2], …… , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], …… , a[K + M - 1] = b[M]. If there are more than one K exist, output the smallest one.
Input
The first line of input is a number T which indicate the number of cases. Each case contains three lines. The first line is two numbers N and M (1 <= M <= 10000, 1 <= N <= 1000000). The second line contains N integers which indicate a[1], a[2], …… , a[N]. The third line contains M integers which indicate b[1], b[2], …… , b[M]. All integers are in the range of [-1000000, 1000000].
Output
For each test case, you should output one line which only contain K described above. If no such K exists, output -1 instead.
Sample Input
2
13 5
1 2 1 2 3 1 2 3 1 3 2 1 2
1 2 3 1 3
13 5
1 2 1 2 3 1 2 3 1 3 2 1 2
1 2 3 2 1
Sample Output
6
-1
题意
给定两个整数数组,判断b数组是否在a数组中出现,并计算出现的位置。
题解
将整数看作字符,那么就变成了一个求字符串匹配问题了。分析n最大有1e6那么大,所以暴力匹配肯定不行啦。
这里采用kmp算法,时间复杂度O(n+m).
没学过kmp,戳这里http://blog.csdn.net/qq_37685156/article/details/78816196
代码
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int maxn=1e6+100;const int maxm=1e4+100;int a[maxn],b[maxm],n,m,pre[maxm];void getpre(){ int j=0; memset(pre,0,sizeof(pre)); for(int i=2;i<=m;i++) { while(j>0 && b[j+1]!=b[i]) j=pre[j]; if(b[j+1]==b[i]) j++; pre[i]=j; }}int kmp(){ int j=0; for(int i=1;i<=n;i++) { while(j>0 && b[j+1]!=a[i]) j=pre[j]; if(b[j+1]==a[i]) j++; if(j==m) return i-m+1; } return -1;}int main(){ int T; scanf("%d",&T); while(T--) { scanf("%d %d",&n,&m); for(int i=1; i<=n; i++) scanf("%d",&a[i]); for(int i=1; i<=m; i++) scanf("%d",&b[i]); getpre(); printf("%d\n",kmp()); } return 0;}
- 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算法
- 模板 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 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]
- 使用canvas 做动态时钟特效
- 事件无法在命名空间里激活错误的解决
- 干货 | 机器学习集成算法:XGBoost模型构造
- 1138. Postorder Traversal (25)
- 连载 | 理解线性代数04 利用行列式求解 Ax = b
- HDU-1711 Number Sequence kmp算法
- ImageLoader的使用
- Reflection2017.12.15
- 一张图看明白Git的四个区五种状态
- VPS中shadowsock配置SOCK5服务器
- Week04_day03 IO流(下) 字符流、缓冲流、转换流
- HashMap和ConcurrentHashMap原理解读(基于JDK1.7)
- G1收集器
- ubuntu16.04安装sublime-text-3