HDU 1711 Number Sequence
2017-08-10 11:11
435 查看
Number Sequence
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28864 Accepted Submission(s): 12140
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
题意概括:
判断第二个数组是否在第一个数组中,若存在输出第二个数组第一个数在第一个数组中出现的位置。
解题分析:
这题就是一道比较水的KMP,只不过把字符串换为数组了。话不多说,上代码。
AC代码:
相关文章推荐
- (kmp)hdu 1711-Number Sequence
- HDU 1711 Number Sequence
- HDU 1711 Number Sequence
- HDU 1711 Number Sequence (KMP找子串第一次出现的位置)(基础模板题)
- HDU 1711 Number Sequence (kmp)
- HDU 1711 Number Sequence
- hdu 1711 Number Sequence
- HDU 1711 Number Sequence(KMP算法)
- hdu 1711 Number Sequence
- hdu 1711 Number Sequence
- Kmp 模板 之 hdu 1711 Number Sequence
- hdu 1711 Number Sequence -- (KMP 求数列第一匹配的位置)
- HDU 1711 Number Sequence
- HDU 1711 Number Sequence【KMP】【模板题】【水题】(返回匹配到的第一个字母的位置)
- HDU 1711 Number Sequence
- HDU 1711 Number Sequence(kmp)
- HDU 1711 Number Sequence (字符串匹配,KMP算法)
- HDU 1711 - Number Sequence(kmp)
- HDU 1711 Number Sequence
- hdu 1711 Number Sequence