DNA Sequencing
A DNA molecule consists of two strands that wrap around each other to resemble a twisted ladder whose sides, made of sugar and phosphate molecules, are connected by rungs of...
分类：
编程语言 时间：
2015-08-27 00:28:26
阅读次数：
199
Mr. Kim is a professional programmer. Recently he wants to design a new editor which has as many functions as possible. Most editors support a simple search function that finds one occurrence (or all ...
分类：
编程语言 时间：
2015-08-27 00:25:43
阅读次数：
198
The Institute of Bioinformatics and Medicine (IBM) of your country has been studying the DNA
sequences of several organisms, including the human one. Before analyzing the DNA of an organism,
the inv...
分类：
编程语言 时间：
2015-08-26 20:14:45
阅读次数：
251
Life Forms
Time Limit: 5000MS
Memory Limit: 65536K
Total Submissions: 11178
Accepted: 3085
Description
You may have wondered why most extraterrestrial life forms rese...
分类：
编程语言 时间：
2015-08-26 17:54:25
阅读次数：
155
Maximum repetition substring
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 8067
Accepted: 2463
Description
The repetition number of a string is defined...
分类：
编程语言 时间：
2015-08-26 14:05:27
阅读次数：
176
REPEATS - Repeats
no tags
A string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed string t with length l>=1. For example, the string
s = abaabaabaaba...
分类：
编程语言 时间：
2015-08-26 12:05:50
阅读次数：
226
o(︶︿︶)o 唉，也是为了应付知识储备太少，万一遇到了类似的题不知道用啥算法就蛋疼了，所以来恶补一下这些东西。
囤一发模板，详细讲解请见2009罗橞骞的论文《后缀数组--处理字符串的有力工具》,基本网上所有的讲解都是来自这篇文章，代码也是这篇论文上的，就不说啥了。
#include
using namespace std;
#define MAXN 100010
char s[MAXN]...
分类：
编程语言 时间：
2015-08-26 01:50:44
阅读次数：
189
Common Substrings
Time Limit: 5000MS
Memory Limit: 65536K
Total Submissions: 8471
Accepted: 2798
Description
A substring of a string T is defined as:
T(i, k)=TiTi+...
分类：
编程语言 时间：
2015-08-25 21:57:13
阅读次数：
172
1517. Freedom of Choice
Time limit: 2.0 second
Memory limit: 64 MB
Background
Before Albanian people could bear with the freedom of speech (this story is fully described in the problem "Free...
分类：
编程语言 时间：
2015-08-21 19:33:06
阅读次数：
293
SUBST1 - New Distinct Substrings
no tags
Given a string, we need to find the total number of its distinct substrings.
Input
T- number of test cases. T
Output
For each test case ou...
分类：
编程语言 时间：
2015-08-21 19:27:35
阅读次数：
168
