Alex_McAvoy的博客

I'm not there,I'm not die.

排序:
默认
按更新时间
按访问量
RSS订阅

Cyclic Nacklace(HDU-3746)

Problem Description CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there...

2019-03-02 13:29:46

阅读数 89

评论数 0

Count the string(HDU-3336)

Problem Description It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can writ...

2019-02-27 18:57:07

阅读数 53

评论数 0

Simpsons’ Hidden Talents(HDU-2594)

Problem Description Homer: 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: ...

2019-02-27 18:39:09

阅读数 65

评论数 0

剪花布条(HDU-2087)

Problem Description 一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input 输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的...

2019-02-27 17:15:18

阅读数 45

评论数 0

Oulipo(POJ-3461)

Problem Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Ou...

2019-02-27 16:45:05

阅读数 76

评论数 0

Period II(FZU-1901)

Problem Description For each prefix with length P of a given string S,if S[i]=S[i+P] for i in [0..SIZE(S)-p-1], then the prefix is a “period” of S....

2019-02-27 11:18:56

阅读数 84

评论数 0

Seek the Name, Seek the Fame(POJ-2752)

Problem Description The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to t...

2019-02-27 09:33:31

阅读数 34

评论数 0

Period(POJ-1961)

Problem Description For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want ...

2019-02-26 21:58:40

阅读数 145

评论数 0

Power Strings(POJ-2406)

Problem Description Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" t...

2019-02-26 18:11:06

阅读数 39

评论数 0

字符串处理 —— 单模式匹配 —— KMP 算法

【概述】 KMP 算法又称Knuth-Morris-Pratt 字符串匹配算法,是由于 D.E.Knuth、J.H.Morris 和 V.R.Pratt 三人共同研究的,用于解决字符串匹配问题。 其核心思想是利用已经部分匹配的有效信息,来保持文本串指针不回溯,通过修改模式串指针,让模式串尽量地...

2019-02-26 16:15:36

阅读数 87

评论数 0

字符串处理 —— 单模式匹配 —— 朴素的字符串匹配算法(BF 算法)

【算法流程】 朴素的字符串匹配算法即暴风(Brute Force)算法,又称暴力匹配算法(BF 算法),其本质是暴力枚举,主要特点有: 没有预处理阶段; 滑动窗口总是后移 1 位; 对模式中的字符的比较顺序不限定,可以从前到后,也可以从后到前; 匹配阶段需要 O((n - m + 1)m...

2019-02-25 20:28:49

阅读数 71

评论数 0

字符串处理 —— 单模式匹配

【问题形式】 文本(Text):长度为 n 的数组 T[1..n] 模式(Pattern):一个长度为 m 且 m≤n 的数组 P[1..m] 有效位移/匹配点(Valid Shift):0≤s≤n-m,且 T[s+1..s+m] = P[1..m],即对 1≤j≤m,有 T[s+j] = ...

2019-02-25 20:26:57

阅读数 111

评论数 0

Blue Jeans(POJ-3080)

Problem Description The Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hun...

2019-01-14 17:08:23

阅读数 66

评论数 0

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