HDOJ ---1711 Number Sequence

Number Sequence


Time Limit: 10000/5000 MS
(Java/Others)    Memory Limit: 32768/32768 K
(Java/Others)
Total Submission(s): 9899    Accepted
Submission(s): 4518

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

Kmp:


 1 #include<cstdio>
2 #define MAXN 1000010
3 int T[MAXN], P[MAXN/10], fail[MAXN/10], N, M, t;
4 void getFail(){
5 fail[0] = -1;
6 for(int i = 1, j = -1;i < M;i ++){
7 while(P[i] != P[j+1] && j >= 0) j = fail[j];
8 if(P[i] == P[j+1]) j++;
9 fail[i] = j;
10 }
11 }
12 void Kmp(){
13 getFail();
14 for(int i = 0, j = 0;i < N;i ++){
15 while(T[i] != P[j] && j) j = fail[j-1] + 1;
16 if(T[i] == P[j]) j++;
17 if(j == M){
18 printf("%d\n", i-M+2);
19 return;
20 }
21 }
22 printf("-1\n");
23 }
24 int main(){
25 scanf("%d", &t);
26 while(t--){
27 scanf("%d%d", &N, &M);
28 for(int i = 0;i < N;i ++) scanf("%d", T+i);
29 for(int i = 0;i < M;i ++) scanf("%d", P+i);
30 Kmp();
31 }
32 return 0;
33 }

HDOJ ---1711 Number Sequence,码迷,mamicode.com

时间: 2024-10-10 06:45:33

HDOJ ---1711 Number Sequence的相关文章

Rabin_Karp(hash) HDOJ 1711 Number Sequence

题目传送门 1 /* 2 Rabin_Karp:虽说用KMP更好,但是RK算法好理解.简单说一下RK算法的原理:首先把模式串的哈希值算出来, 3 在文本串里不断更新模式串的长度的哈希值,若相等,则找到了,否则整个模式串的长度的哈希值向右移动一位 4 */ 5 /************************************************ 6 * Author :Running_Time 7 * Created Time :2015-8-5 14:04:26 8 * File

hdoj 1711 Number Sequence 【KMP】

Number Sequence Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11817    Accepted Submission(s): 5395 Problem Description Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1],

hdoj 1711 Number Sequence【求字串在母串中第一次出现的位置】

Number Sequence Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15017    Accepted Submission(s): 6585 Problem Description Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b

HDU - 1711 Number Sequence KMP字符串匹配

HDU - 1711 Number Sequence Time Limit: 5000MS   Memory Limit: 32768KB   64bit IO Format: %I64d & %I64u Submit Status Description Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <=

HDU 1711 Number Sequence(KMP算法)

题目链接: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): 15548    Accepted Submission(s): 6836 Problem Description Given two sequence

KMP算法的定义及KMP练手题 HDU 1711 Number Sequence (我的模板代码)

题意:就是要你来找出b数组在a数组中最先匹配的位置,如果没有则输出-1 思路:直接KMP算法(算法具体思想这位牛写的不错http://blog.csdn.net/v_july_v/article/details/7041827) AC代码: #include<cstdio> #include<cstring> #include<stdlib.h> #include<iostream> using namespace std; #define maxn 100

hdu 1711 Number Sequence(KMP)

# include <stdio.h> # include <string.h> # include <algorithm> using namespace std; int n,m,next[10010],a[1000010],b[10010]; void Getnext() { int i=0,j=-1; next[0]=-1; while(i<m) { if(j==-1||b[i]==b[j]) i++,j++,next[i]=j; else j=next[

HDU 1711 Number Sequence KMP题解

KMP查找整数数列,不是查找字符串. 原理是一样的,不过把字符串转换为数列,其他基本上是一样的. #include <stdio.h> #include <string.h> const int MAX_N = 1000001; const int MAX_M = 10001; int strN[MAX_N], strM[MAX_M], next[MAX_M], N, M; void getNext() { memset(next, 0, sizeof(int) * M); for

杭电 1711 Number Sequence

Number Sequence Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10239    Accepted Submission(s): 4656 Problem Description Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1],