HDOJ 1711Number Sequence
2015-08-20 11:10
369 查看
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 15622 Accepted Submission(s): 6877
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
Total Submission(s): 15622 Accepted Submission(s): 6877
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
#include <cstdio> const int N = 1000010; const int M = 10010; int ary ; int p[M], next[M]; int n, m; void get_next() { int i = 0, j = -1; next[0] = -1; while (i < m) { if (j == -1 || p[i] == p[j]) { ++i, ++j; if (p[i] != p[j]) next[i] = j; else next[i] = next[j]; } else j = next[j]; } } int KMP() { int i = 0, j = 0; while (i < n && j < m) { if (ary[i] == p[j]) ++i, ++j; else { if (next[j] == -1) ++i, j = 0; else j = next[j]; } } if (j == m) return i - j + 1; else return -1; } int main() { int T; scanf("%d", &T); while (T--) { scanf("%d%d", &n, &m); for (int i = 0; i < n; ++i) scanf("%d", ary + i); for (int i = 0; i < m; ++i) scanf("%d", p + i); get_next(); printf("%d\n", KMP()); } return 0; }
相关文章推荐
- string.trim() & rawQuery()
- WindowsAPI之GetFileVersionInfo函数和VerQueryValue函数
- iOS UISlider自定义高度
- 第十三篇 continue; 换行/n和回车/r; String vs StringBuilder 消耗时间
- java 调用ant的自定义task,默认不是build.xml 的一点问题
- STL map 按key值和按value值排序
- 在ios7中获取唯一标识符(UDID/UUID)
- Havok_2014-1-0_Pc_Xs_User_Guide(3.1-Havok动画简介)
- Updates are currently disallowed on GET requests. To allow updates on a GET, set the 'AllowUnsafeUp
- 设置UISegmentedControl中字体大小
- 01-复杂度2. Maximum Subsequence Sum (25)
- Foundation框架—NSNumber、NSValue、NSDate
- easyui编辑器(kindeditor-4.1.10)
- UIPopoverPresentationController简单使用
- UVA 11045-My T-shirt suits me(二分图匹配)
- UIElementCollection
- dpkg: error processing package bluez (--configure) 解决方法
- 【转载】使用SoapUI 测试Web Service
- 后台UI模板开发规范
- NGUI sprite 裁剪到其他图片sprite