olahiuj的博客

想要再努力一点

2017年11月2日提高组T1 Sequence

DescriptionInputOutputHintSolution想像一下,把点在坐标系里面描出来就能发现实际上是要找出多少段连续m个点描出的平滑曲线与b平行(意会一下)。一个简单的方法是做一个差分数组,kmp判断有多少字串。差分数组相同保证了相邻两点的斜率相同(口胡)这里写了不太熟悉的字符串哈...

2017-11-08 19:38:48

阅读数:86

评论数:0

2017年09月07日提高组第一式 B

DescriptionAlice和Bob正在悄悄地给对方发信息,信息都是由英文小写字母组成的,他们约定,所有的字母都得经过一个字母表进行变换,以防泄漏。另一方面John却在监听。 John发现,Alice和Bob通信的时候,总是先发送加密后的密文,然后紧接着发送原文。 但是Alice和Bo...

2017-09-13 21:50:46

阅读数:127

评论数:0

Simpsons' Hidden Talents hdu2594 kmp

DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had. Marge: Yeah, what is it? Homer: Take me ...

2017-05-01 20:17:47

阅读数:205

评论数:0

Period_poj1961_kmp

DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know wh...

2016-08-17 19:16:55

阅读数:222

评论数:0

Power Strings_poj2406_kmp

DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = “abc” and b = “def” then a*b = “abcdef”. If we thin...

2016-08-14 19:11:24

阅读数:227

评论数:0

Oulipo_poj3461_kmp

DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter ‘e’. He was a member of the Oulipo group...

2016-08-13 21:54:24

阅读数:368

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭