ACM-KMP
KMP
luyehao1
ACMer
展开
-
Number Sequence(HDU 1711 KMP)
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 on原创 2017-07-24 16:37:34 · 226 阅读 · 0 评论 -
Best Reward (hdu 3613 拓展KMP)
After an uphill battle, General Li won a great victory. Now the head of state decide to reward him with honor and treasures for his great exploit. One of these treasures is a necklace made up of 26 different kinds of gemstones, and the length of the neck原创 2017-07-26 20:30:37 · 245 阅读 · 0 评论 -
A Secret(HDU 6153 扩展KMP)
Today is the birthday of SF,so VS gives two strings S1,S2 to SF as a present,which have a big secret.SF is interested in this secret and ask VS how to get it.There are the things that VS tell: Suffix(S2,i) = S2[i...len].Ni is the times that Suffix(S2,i)原创 2017-09-21 15:27:00 · 326 阅读 · 0 评论