AC自动机(Aho-Corasick Automaton Algorithm)
来源:互联网 发布:java泛型t 基本类型 编辑:程序博客网 时间:2024/05/21 15:02
//AC自动机(Aho-Corasick Automaton Algorithm)(1)建trie树
(2)广度优先搜索构建所有结点的fail
构造next指针,概括起来是:假如当前的节点的字符为e,沿着它的父亲的next指针走,直到找到一个结点,它的孩子也有e这个字符,然后将当前结点的next指针指向那个结点有e这个孩子的孩子e。
从root开始广度优先搜索每个点,如果当前搜的点的孩子,与该点的next指针指向的点有相同的孩子,则当前点的孩子指向next指针的孩子,
否则next指针循环搜回去,如果搜不到就指向root。
(3)查找当时的文本字符串为text,长度为len则有:ptr=root;for i:=1 to len-1 dowhile(ptr->text[i]==NULL&&ptr!=root)ptr=ptr->next;ptr=ptr->child[i];if(ptr==NULL) then ptr=root;//如果搜不到回到根结点HDOJ2002Keywords Search
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8434 Accepted Submission(s): 2828
Problem Description
In the modern time, Search engine came into the life of everybody like Google, Baidu, etc.
Wiskey also wants to bring this feature to his image retrieval system.
Every image have a long description, when users type some keywords to find the image, the system will match the keywords with description of image and show the image which the most keywords be matched.
To simplify the problem, giving you a description of image, and some keywords, you should tell me how many keywords will be match.
Wiskey also wants to bring this feature to his image retrieval system.
Every image have a long description, when users type some keywords to find the image, the system will match the keywords with description of image and show the image which the most keywords be matched.
To simplify the problem, giving you a description of image, and some keywords, you should tell me how many keywords will be match.
Input
First line will contain one integer means how many cases will follow by.
Each case will contain two integers N means the number of keywords and N keywords follow. (N <= 10000)
Each keyword will only contains characters 'a'-'z', and the length will be not longer than 50.
The last line is the description, and the length will be not longer than 1000000.
Each case will contain two integers N means the number of keywords and N keywords follow. (N <= 10000)
Each keyword will only contains characters 'a'-'z', and the length will be not longer than 50.
The last line is the description, and the length will be not longer than 1000000.
Output
Print how many keywords are contained in the description.
Sample Input
15shehesayshrheryasherhs
Sample Output
3
- AC自动机(Aho-Corasick Automaton Algorithm)
- AC自动机(Aho-Corasick automaton)
- AC自动机——Aho-Corasick Automaton
- 浅谈AC自动机(Aho-Corasick automaton算法)
- Aho-Corasick automation,AC 自动机
- Aho-Corasick自动机算法(简称AC自动机
- 【Aho-Corasick Automaton】
- 【AC自动机】:Aho-Corasick算法的实现
- Aho-Corasick自动机算法(AC算法解读)
- Aho-Corasick 自动机
- AC自动机(Aho-Corasick automation)(转)
- 【算法笔记】Aho-Corasick 算法(AC自动机) 小结
- Aho-Corasick 多模式匹配算法、AC自动机详解
- Aho-Corasick 多模式匹配算法、AC自动机详解
- Aho-Corasick算法—Trie图(AC自动机)
- 【AC自动机】【数据结构】【树】【Aho-Corasick automation】AC自动机理解(入门)
- HDU-2222-Aho-Corasick--自动机
- Hdu 2222 Keywords Search//Aho-Corasick 自动机
- Spring Security 取Session中的值和修改userDetails
- leftnoteasy:机器学习中的数学(4)-线性判别分析(LDA), 主成分分析(PCA)
- 无题!
- LBP算子介绍
- leftnoteasy:机器学习中的数学(5)-强大的矩阵奇异值分解(SVD)及其应用
- AC自动机(Aho-Corasick Automaton Algorithm)
- 完整的Flex多文件上传实例
- leftnoteasy:机器学习中的数学(6)-决策树模型组合之随机森林与GBDT
- 初来乍到
- Spring Security
- C++学习总结_改变指针变量的地址
- selinux 常用指令
- 敏捷之道——提高命令行编辑速度
- p2p.download.Downloader