hduoj1711(kmp)
Number Sequence
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.
波斯王子有好多部,前3部是一个完整的故事,后面则是一些衍生
十年前玩的游戏,环境渲染和剧情真的超棒