Number Sequence
来源:互联网 发布:红外图像处理算法 编辑:程序博客网 时间:2024/06/16 07:20
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.
213 51 2 1 2 3 1 2 3 1 3 2 1 21 2 3 1 313 51 2 1 2 3 1 2 3 1 3 2 1 21 2 3 2 1
6-1
#include<cstdio>#include<cstring>int a[1000005],b[1000005],next[1000005];void makenext(int *b,int m){next[0]=0;int k=0;for(int i=1;i<m;i++){while(k>0&&b[k]!=b[i])k=next[k-1];if(b[i]==b[k])k++;next[i]=k;}}int kmp(int *a,int n,int *b,int m){int k=0,i;for(i=0;i<n;i++){while(k>0&&a[i]!=b[k])k=next[k-1];if(b[k]==a[i])k++;if(k==m)return i-m+1+1;}if(i==n&&k<m)return -1;}int main(){int T,n,m,i,j,l1,l2,t;scanf("%d",&T);while(T--){scanf("%d%d",&n,&m);for(i=0;i<n;i++)scanf("%d",&a[i]);for(i=0;i<m;i++)scanf("%d",&b[i]);makenext(b,m);t=kmp(a,n,b,m);printf("%d\n",t);}return 0;}
阅读全文
0 0
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Number Sequence
- Scrapy实例1-爬取天气预报存储到Json
- SPRING 事务
- Storm通信机制
- [题解] CodeForces 429B Working out
- Mybatis的输入输出映射和全局配置文件
- Number Sequence
- Java面试题全集(中)
- 如何通过牛顿方法解决Logistic回归问题 By 机器之心2017年8月09日 16:30 本文介绍了牛顿方法(Newton's Method),以及如何用它来解决 logistic 回归。log
- POJ-1475:Pushing Boxes(嵌套bfs或bfs+A*算法)
- 找出三个最大值demo
- window应用程序靠消息驱动、Marshal类、StructureToByte、ByteToStructure
- MathGL在Windows下的编译
- 二叉树的一些性质
- Java面试题全集(下)