字符串
brambles-sea
起风了
展开
-
hdu 1711 Number Sequence
hdu 1711 Number Sequence 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].原创 2017-07-31 17:40:02 · 189 阅读 · 0 评论 -
扩展KMP算法
参考:点击打开链接第一种情况:k+len如下图所示: 上图中,S[k+1,k+len]=T[0,len-1],然后S[k+len+1]一定不等于T[len],因为如果它们相等,则有S[k+1,k+len+1]=T[k+po+1,k+po+len+1]=T[0,len],那么next[k+po+1]=len+1,这和next数组的定义不符(next[转载 2017-07-31 17:40:52 · 152 阅读 · 0 评论 -
2015ACM/ICPC亚洲区沈阳站 HDU
BazingaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5242 Accepted Submission(s): 1647Problem DescriptionLadies and gentlem原创 2017-10-14 19:03:11 · 355 阅读 · 0 评论