kmp
文章平均质量分 80
To_be_strong
一步一个脚印
展开
-
hdu 1711(kmp算法)
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] =原创 2015-08-11 11:28:01 · 211 阅读 · 0 评论 -
hdu 3749 Cyclic Nacklace(kmp next数组获取循环节)
Cyclic Nacklace Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4104 Accepted Submission(s): 1852 Problem Description CC always原创 2015-08-11 16:39:18 · 466 阅读 · 0 评论