Azarath Metrion Zinthos

Detect the VirusTime Limit: 2 Seconds      Memory Limit: 65536 KBOne day, Nobita found that his computer is extremely slow. After several hours' work, he finally found that it was a virus th

Clairewd’s messageTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2296    Accepted Submission(s): 901Problem DescriptionClairewd

#include#include#includeusing namespace std;const int MM=100005;int next[MM],extand[MM];char S[MM],T[MM];void GetNext(const char *T){ int len=strlen(T),a=0; next[0]=len; while(a<

Problem E: Compound WordsYou are to find all the two-word compound words in a dictionary. A two-word compound word is a word in the dictionary that is the concatenation of exactly two other word

DescriptionDr. Ellie Arroway has established contact with an extraterrestrial civilization. However, all efforts to decode their messages have failed so far because, as luck would have it, the

7758. Growing StringsProblem code: MGLAR10  EnglishVietnamese   Gene and Gina have a particular kind of farm. Instead of growing a

挖坑...----------------------------一 模板----------------------------const int maxn=1111111;char P[maxn];char T[maxn];int f[maxn];void getFail(char P[],int f[]){ int i=0,j=-1; int

-----------------A string is finite sequence of characters over a non-empty finite set Σ.In this problem, Σ is the set of lowercase letters.Substring, also called factor, is a consecutiv

-------------ReincarnationTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1439    Accepted Submission(s): 503Problem Descript

*在学习后缀自动机之前需要熟练掌握WA自动机、RE自动机与TLE自动机*什么是后缀自动机后缀自动机 Suffix Automaton （SAM） 是一个用 O(n) 的复杂度构造，能够接受一个字符串所有后缀的自动机。它最早在陈立杰的 2012 年 noi 冬令营讲稿中提到。在2013年的一场多校联合训练中，陈立杰出的 hdu 4622 可以用 SAM 轻松水过，由此 S

什么是后缀数组后缀树（Suffix tree）是一种数据结构，能快速解决很多关于字符串的问题。

Similar WordTime Limit 1000msMemory Limit 65536Kdescription　　It was a crummy day for Lur. He failed to pass to the CET-6 (College English Test

English GameTime Limit 1000msMemory Limit 65536Kdescription　　This English game is a simple English words connection game.　　The rules are as f

AC自动机算法AC自动机简介： 首先简要介绍一下AC自动机：Aho-Corasick automation，该算法在1975年产生于贝尔实验室，是著名的多模匹配算法之一。一个常见的例子就是给出n个单词，再给出一段包含m个字符的文章，让你找出有多少个单词在文章里出现过。要搞懂AC自动机，先得有字典树Trie和KMP模式匹配算法的基础知识。KMP算法是单模式串的字符匹配算法，AC自动机是多

每个节点只访问一次。//子树节点是在插入时new的，//寻找失配指针中使用的队列是直接调用STL的const int kind = 26;struct node{ node *fail; node *next[kind]; int count;//记录当前前缀是完整单词出现的个数 node() { fail = NULL;

DNA repairTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 872    Accepted Submission(s): 473Problem DescriptionBiologists finall

Problem E: Vacation The ProblemYou are planning to take some rest and to go out on vacation, but you really don't know which cities you should visit. So, you ask your parents for hel

//用类，或者结构体定义都行class trie{public: trie* next[26]; int num; int value; trie() { for(int i=0;i<26;i++) next[i]=0; value=0;//记录是不是一个单词 num=0;//记录单词出现的次数

要想使用标准C++中string类，必须要包含#include // 注意是，不是，带.h的是C语言中的头文件using  std::string;using  std::wstring;或using namespace std;下面你就可以使用string/wstring了，它们两分别对应着char和wchar_t。string和wstri

Neal is very curious about combinatorial problems, and now here comes a problem about words. Knowing that Ray has a photographic memory and this may not trouble him, Neal gives it to Jiejie.Since Ji

#include #include #include using namespace std;int f[1111111];void getfail(char* P,int *f){ int m=strlen(P); f[0]=f[1]=0; for (int i=1;i<m;i++) { int j=f[i]; w

For 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 whether the prefix is a periodic string. That is, for each i (2

Keywords SearchTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23502    Accepted Submission(s): 7763Problem DescriptionIn the mo

Computer Virus on Planet PandoraTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 256000/128000 K (Java/Others)Total Submission(s): 1609    Accepted Submission(s): 454Problem Descrip

--------/** this code is made by cyendra* Problem: 1430* Verdict: Accepted* Submission Date: 2014-10-06 13:10:01* Time: 5740MS* Memory: 3804KB*/#include #include #include using namespac