HDU 1711 Number Sequence kmp
2015-08-31 19:47
591 查看
Number Sequence
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15821 Accepted Submission(s): 6978
Problem Description
Given two sequences of numbers : a[1], a[2], ...... , a
, 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
. 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
Source
HDU 2007-Spring Programming Contest
Recommend
lcy | We have carefully selected several similar problems for you: 1358 3336 1686 3746 1251
ACcode
#include <map> #include <queue> #include <cmath> #include <cstdio> #include <cstring> #include <stdlib.h> #include <iostream> #include <algorithm> #define maxn 100 using namespace std; int N[1000000+10]; int M[10000+10]; int nex[10000+10]; int main(){ int loop,la,lb; scanf("%d",&loop); while(loop--){ scanf("%d%d",&la,&lb); for(int i=0;i<la;++i) scanf("%d",&N[i]); for(int i=0;i<lb;++i) scanf("%d",&M[i]); int pos=0,j=0; nex[0]=-1; nex[1]=0; for(int i=2;i<lb;++i){ while(pos>=0&&M[pos]!=M[i-1]) pos=nex[pos]; nex[i]=++pos; } int p=0,cur=0,t=-1; while(cur<la){ if(N[cur]==M[p]){ cur++; p++; } else if(p>=0) p=nex[p]; else { cur++; p=0; } if(p==lb){ t=cur-lb+1; break; } } printf("%d\n",t); } return 0; }
相关文章推荐
- iphone开发之表格组件UITableView的使用(四) 通过加载plist文件展示单组数据
- 深入浅出CChart 每日一课——快乐高四第十四课 枝头红杏,Win32标准控件ChartCtrl之围城
- UIScrollView、UIPageControl
- easyui validatebox 去除校验 绑定校验
- UIScrollView+UIPageControl+NSTimer 图片自动滚动的两种实现方法
- UITabBarController的使用
- iOS7 CookBook精彩瞬间(三)UIActivityViewController的基本使用及自定义Activity
- iOS7 CookBook精彩瞬间(三)UIActivityViewController的基本使用及自定义Activity
- UIslide
- UIControl 及其子类
- Memo Mirantis Fuel 6.0安装札记
- [底层] 为什么Integer.MIN_VALUE-1会等于Integer.MAX_VALUE
- UITableview reloadData偶尔出现崩溃
- NGUI消耗性能分析
- 玩转EasyUI之ValidateBox
- iOS开发基础-UIButton
- iOS开发基础-UILabel
- openstack quick start
- 将ueditor上传的视频转换为flowplayer播放,并隐藏其播放地址
- Arduino板的DHT11温湿度传感器使用